Skip to content

Tracks

AI-assisted engineering Working with AI Agents System design Core systems Data and AI systems Coding Coding problems Code review On-call SQL

Practice

Paths Concept guides

FreeAd-supported

The plan adds AI feedback and removes ads.

Concept guides/Dynamic programming/Knapsack & subset-sum

CodingDynamic programming

Knapsack & subset-sum

Medium3 min read

Questions it teaches

Smallest stone after smashingMedium25 min Partition array sum with signsMedium25 min Ones and zeroesMedium25 min Partition minimum differenceMedium25 min 0/1 knapsackMedium25 min Partition equal subset sumMedium20 min Coin change waysMedium20 min Count distinct coin sumsMedium25 min

Related

Dynamic programming Arrays and strings Bits and math Graphs and trees Backtracking and games

Builds on: Arrays and strings

Arrays & in-place tricks3 min Hash maps & sets3 min

Builds on: Bits and math

Experiment math without floats4 min Math & number theory3 min

Builds on: Graphs and trees

Graph traversal (BFS & DFS)3 min Critical path scheduling4 min

Related: Backtracking and games

Recursion & backtracking3 min Game theory & Grundy3 min

© 2026 Prep Room·From California·AI can make mistakes.

About Legal Contact Cookies Your privacy choices

Home Review Tracks Paths