🎓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

Problems37

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
dp
Custom#cp011
1700

Bitwise Subsequence Shift Sum

Phase 5 / dp, bitwise, LIS

bitwisedpsubsequence
Custom#cp010
1800

Matrix Path with Alternating Parity

Phase 5 / dp, grid, parity

dpgridparity
Custom#cp001
2100

Split Array with Maximum Distincts

Phase 6 / dp, sliding window, optimization

dpgreedysliding windowset
Custom#cptp009
1500

Minimum Cost Non-Adjacent

Phase 4 / dp, house_robber_variant

dparraysgreedy
Custom#cp-tp3-018
2300

Longest Monotone Bitwise Subsequence

Phase 3 / bitwise-lis

arraybitwiseLISdp
Custom#cp-tp3-017
1725

Sumset Subsequence Counting

Phase 3 / subsequence-enumeration

combinatoricsdpsubsequenceset
Custom#cp-tp3-012
2000

Minimal Block Merge Cost

Phase 3 / dp-knuth

dpinterval-dpknuthmerge-cost
Custom#cp-tp3-010
2250

Binary Tree Subpath Sum XOR

Phase 3 / tree-dp

treedpxorprefix-sum
Custom#P017
1600

Minimal Cost Full Coverage Intervals

Phase 2 / Greedy, Segment Cover

greedyinterval coverdp
Custom#P016
1800

Longest Path With Type Alternation

Phase 2 / Tree DP

treedppath
Custom#P009
1900

Topological Order with Degree Constraint

Phase 2 / DP, Topological Sorting

dptoposortenumeration
Custom#P004
1600

Partitioned GCD Sum

Phase 2 / DP, GCD

dpgcdpartition
1234