Skip to content
DeepForgeby svx
Advancedalgorithmsinterviewsdynamic-programminggraphs

Algorithms Interview Grind

26 problems·~15h·4 stages

The highest-yield coding interview patterns in one sequence: two pointers, sliding windows, dynamic programming, heaps, and graph search. You will solve the canonical problems that show up in FAANG screens, implemented in pure Python. Built for interview season, not for casual browsing.

Your progress

0/26 · 0%

Path readiness 0%Easy 0% · Medium 0% · Hard 0%

Continue path · Binary Search

What you will learn

  • Master two-pointer, prefix-sum, and sliding-window patterns
  • Solve the canonical dynamic-programming problems without hints
  • Run BFS, Dijkstra, and topological order under interview time pressure
  • Handle heaps, deques, and hard string problems

Before you start

1Arrays and Two Pointers

0/8

Interview warm-ups: binary search, sorted pair sums, prefix sums, anagram checks, bracket matching, fast exponentiation, and bit tricks.

Stage checkpoint

0/2 to pass

A checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.

Tried this set and did not pass? Record it — the next set swaps in fresh problems from the same stage.
SimulationRecommended next stepDijkstra Step-Through

2Windows and Subarrays

0/6

Contiguous-range patterns: maximum subarray sum, longest increasing subsequence, merging intervals, subarray sums, word break, and the largest histogram rectangle.

Stage checkpoint

0/2 to pass

A checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.

Tried this set and did not pass? Record it — the next set swaps in fresh problems from the same stage.
SimulationRecommended next stepDijkstra Step-Through

3Dynamic Programming

0/6

The DP canon: 0/1 knapsack, longest common subsequence, coin change, house robber, edit distance, and the median of two sorted arrays.

Stage checkpoint

0/2 to pass

A checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.

Tried this set and did not pass? Record it — the next set swaps in fresh problems from the same stage.
SimulationRecommended next stepDijkstra Step-Through

4Graphs and Hard Patterns

0/6

Graph search and the hard tier: Dijkstra, course scheduling, sliding-window maximum with a deque, word ladder, merging k sorted lists, and minimum window substring.

Stage checkpoint

0/2 to pass

A checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.

Tried this set and did not pass? Record it — the next set swaps in fresh problems from the same stage.
SimulationRecommended next stepDijkstra Step-Through

Capstone

Contest

Close the path with one real artifact from the catalog.

Hard Mode

Sit the full hour of genuinely hard problems to prove the grind paid off.