Skip to content

CodingLevel 4

Dynamic programming

Easy

Medium

Hard

Continue Read the guide View as list

Dynamic programming: 2D & stringsComparing two strings or sequences by building a matrix of answers.3 min Dynamic programming: 1DSolve a massive problem by solving smaller versions of it and remembering the answers.3 min Advanced DP patternsApplying DP on structures other than arrays, like Trees or Digits.3 min Why your query is slow: reading the planAn index isn't a speed button, the planner uses it only when it fetches few enough rows to be worth the trip.4 min Knapsack & subset-sumChoosing the optimal combination of items under a strict capacity constraint.3 min Interval DPSolve problems on segments by building answers from small intervals up to the entire array.3 min Bitmask DPTrack a tiny set of visited items using the 0s and 1s of a single integer.3 min