Data Structures & Algorithms: Advanced Patterns and Interview Mastery

<p>Renata Cruz has cleared the phone screens for an onsite loop at Cascade Systems, and the recruiter's note is blunt: expect tree and graph problems at depth. Staff engineer Elliot Marsh agrees to run her through six mock-interview sessions, and this course follows every one of them. You'll go beyond textbook traversals into height-balanced trees, lowest common ancestor, and BST-specific shortcuts; BFS and DFS applied to mazes, islands, and cycle detection; topological sort and shortest paths (Dijkstra and Bellman-Ford) framed around real dependency-scheduling problems; dynamic programming built up from honest brute force through memoization and tabulation into knapsack, string, grid, and interval DP; and greedy algorithms taught through the exchange argument that proves when they work -- and the coin-change counterexample that proves when they quietly fail. Every technique is driven by a real, meaty problem first, with working Python code, not a lecture followed by an afterthought exercise.</p>

Tools: Trees, Graphs (BFS/DFS), Dynamic Programming, Greedy Algorithms, Shortest Paths, Topological Sort