🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
⏱️Coach🧩Problems🧠Thinking🎯Prompts🧠Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Problems6

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
subsequence
Custom#cp012-842
1800

Minimal Unique Subsequence Merge

Phase 5 / strings, greedy, sets

stringsgreedysubsequence
Custom#cp011
1700

Bitwise Subsequence Shift Sum

Phase 5 / dp, bitwise, LIS

bitwisedpsubsequence
Custom#cptp004
1600

Increasing Subsequence Partition

Phase 4 / patience_sorting, sequence_decomposition

greedysubsequencepatience-sorting
Custom#cp-tp3-017
1725

Sumset Subsequence Counting

Phase 3 / subsequence-enumeration

combinatoricsdpsubsequenceset
Custom#P003
1500

Modulo K Longest Increasing Subsequence

Phase 2 / DP, Number Theory

dpnumber theorysubsequence
Custom#p010
1850

Almost Increasing Sequence Removals

Phase 1 / dp, subsequence

dpgreedysubsequencearrays