On this page
Practice Plan
📚 DSA Revision Plan — Ambient.ai Target
Strategy
- Week 1 (Diagnosis + Warmup): Arrays, Two Pointers, Hashmaps — the foundations
- Week 2 (Core): Trees, Graphs, Binary Search, Stacks/Queues
- Week 3 (Hard): DP, Heaps, Intervals, LRU Cache
- Week 4 (GOAT mode): Mixed review + mock rounds + Go concurrency patterns
Topic Breakdown
Arrays & Hashing (10 problems)
- Two Sum, Group Anagrams, Top K Frequent, Product of Array Except Self
- Valid Sudoku, Longest Consecutive Sequence, Contains Duplicate
Two Pointers (8 problems)
- Valid Palindrome, Two Sum II, 3Sum, Container With Most Water
- Trapping Rain Water
Sliding Window (6 problems)
- Best Time to Buy/Sell Stock, Longest Substring Without Repeating
- Longest Repeating Character Replacement, Minimum Window Substring
Trees (10 problems)
- Invert Tree, Max Depth, Diameter, Balanced Tree
- Same Tree, Subtree, Level Order, LCA
- Serialize/Deserialize, Validate BST
Graphs (10 problems)
- Number of Islands, Clone Graph, Course Schedule (Topo Sort)
- Pacific Atlantic Water Flow, Word Ladder, Dijkstra
- Union-Find basics
Dynamic Programming (10 problems)
- Climbing Stairs, Coin Change, LIS, LCS
- 0/1 Knapsack, House Robber, Palindromic Substrings
- Grid problems (unique paths, min path sum) — ambient.ai = CV = grids
- Combination Sum
LRU Cache / OOD (3 problems)
- LRU Cache (must know)
- Design Twitter / Autocomplete
Go Concurrency (5 problems — in Go)
- Goroutine basics, WaitGroup patterns
- Fan-in/Fan-out with channels
- Dining Philosophers / Reader-Writer mutex
Resources
- LeetCode — all problem references linked
- NeetCode 150 — good curated list to follow
- Go by Example — for concurrency patterns