🎓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#P003
1500

Modulo K Longest Increasing Subsequence

Phase 2 / DP, Number Theory

dpnumber theorysubsequence
Custom#P002
1800

Tree Rerooting Value

Phase 2 / Tree DP, Rerooting

treererootingdp
Custom#p020
1900

Weighted Longest Common Subsequence

Phase 1 / dp, lcs, greedy

dpstringlcsgreedy
Custom#p018
2150

Balanced Subtree Queries

Phase 1 / tree, dfs, dp

treedpdfssubtree
Custom#p016
1600

Odd Degree Vertex Removal

Phase 1 / graph, parity, dp

graphdegreeparitydp
Custom#p010
1850

Almost Increasing Sequence Removals

Phase 1 / dp, subsequence

dpgreedysubsequencearrays
Custom#p004
1600

Lexicographically Minimal Path Grid

Phase 1 / dp, lex_order

dpgridstringslexicographical
Custom#ct-p5-04
2280

Aliens Trick Budget DP

Phase 5 / advanced-dp

dpparametric-searchoptimization
Custom#ct-p3-04
1880

Two-Layer Topological Scheduling

Phase 3 / graph-shortest-path

topological-sortdpscheduling
Custom#ct-p6-02
2350

Directed Move Grundy

Phase 6 / game-theory

game-theorygrundydp
Custom#ct-p3-02
1850

Bounded Jumps Maximum Score

Phase 3 / monotone-queue-dp

dpdequeoptimization
Custom#ct-p3-01
1800

Minimum Palindromic Cuts with Cost

Phase 3 / classic-dp

dpstringtransition-design
1234