← All coursesPython

DSA Dojo III

Graphs, DP, and the patterns interviews actually reuse.

Level up from arrays into graphs and dynamic programming — BFS/DFS, topo sort, DP tables, then the interval / heap / grid patterns that keep showing up in interviews. Same deal as Dojo I: tiny walkthrough, visualizer when it helps, and Python practice in the sandbox.

Learn with Ada, your AI coding mentor — ask questions or tap I’m stuck in any lesson for a nudge without spoilers.

Advanced13 lessons~12h
First lesson free

Try lesson 1 without an account. Sign in to unlock the remaining 12 lessons and save progress.

Course content

1 · Graphs

  • ○Graphs: Adjacency Lists, Not Matrix PanicFree16 min
  • 🔒BFS: Shortest Path on Unweighted Graphs20 min
  • 🔒DFS: Connected Components18 min
  • 🔒Course Schedule: Topo Sort + Cycle Detect22 min

2 · Dynamic Programming

  • 🔒DP Mindset: Fib Without Recursion Blowup16 min
  • 🔒Climbing Stairs15 min
  • 🔒House Robber18 min
  • 🔒Coin Change (Fewest Coins)22 min
  • 🔒Longest Increasing Subsequence24 min

3 · Interview Patterns

  • 🔒Merge Intervals18 min
  • 🔒Top K Frequent Elements20 min
  • 🔒Word Search on a Grid22 min
  • 🔒Pattern Recap: Two Sum II + Hash Muscle Memory18 min