Practice
24 problems across 8 topics, 650 minutes of work. Hints come one at a time and the solution stays shut until you ask. Progress is saved on this device.
24 problems
- Single Stock TradeArraysEasy#single-pass#running-minimum15m
- Drop Sorted DuplicatesArraysEasy#two-pointers#in-place15m
- Product Of OthersArraysMedium#prefix-products#two-pass25m
- Longest Distinct RunArraysMedium#sliding-window#hash-map25m
- Window MaximumsArraysHard#sliding-window#monotonic-deque40m
- Merge Sorted ChainsLinked ListsEasy#two-pointers#dummy-node20m
- Drop Nth From EndLinked ListsMedium#fast-slow-pointers#dummy-node25m
- Weave List HalvesLinked ListsMedium#fast-slow-pointers#list-reversal35m
- Constant Time Min StackStacks & QueuesEasy#stack#auxiliary-stack20m
- Days Until WarmerStacks & QueuesMedium#monotonic-stack30m
- Repeated Value CheckHash TablesEasy#hash-set#single-pass10m
- Subarrays Summing To KHash TablesMedium#prefix-sums#hash-map30m
- Longest Consecutive RunHash TablesMedium#hash-set#counting30m
- Deepest Level CountTrees & BSTEasy#dfs#recursion15m
- Zigzag Level WalkTrees & BSTMedium#bfs#level-order30m
- Right Edge ViewTrees & BSTMedium#bfs#level-order25m
- Kth Largest ValueHeapsMedium#min-heap#top-k25m
- Count Island BlobsGraphsMedium#dfs#flood-fill#grid-traversal30m
- Course Order FeasibilityGraphsMedium#topological-sort#cycle-detection35m
- Word Ladder StepsGraphsHard#bfs#shortest-path45m
- Cheapest Stair ClimbDynamic ProgrammingEasy#bottom-up-dp#rolling-variables20m
- Grid Paths With BlocksDynamic ProgrammingMedium#grid-dp#bottom-up-dp30m
- Sentence SegmentationDynamic ProgrammingMedium#bottom-up-dp#hash-set30m
- Trading With CooldownDynamic ProgrammingHard#state-machine-dp#rolling-variables45m