Course
Interview Patterns: Cracking FAANG+ in the AI Era
40 lessons · Fundamentals. Start at lesson one and work through in order.
- 1. Arrays and Hashing
- 2. Two Pointers
- 3. Sliding Window
- 4. Stack
- 5. Binary Search
- 6. Linked Lists
- 7. Recursion
- 8. Sorting in Interviews
- 9. Bit Manipulation
- 10. Math Patterns
- 11. Interview Patterns L11: Binary Tree Traversal
- 12. Interview Patterns L12: BST Operations
- 13. Interview Patterns L13: Tree Construction
- 14. Interview Patterns L14: Tree DFS Patterns
- 15. Interview Patterns L15: Tree BFS Patterns
- 16. Interview Patterns L16: Graph BFS
- 17. Interview Patterns L17: Graph DFS
- 18. Interview Patterns L18: Topological Sort
- 19. Interview Patterns L19: Union Find
- 20. Interview Patterns L20: Shortest Path
- 21. 1D DP Basics
- 22. 1D DP Advanced
- 23. 2D DP Basics
- 24. 2D DP Advanced
- 25. DP on Strings
- 26. DP on Trees
- 27. Knapsack Patterns
- 28. Interval DP
- 29. State Machine DP
- 30. Bitmask DP
- 31. Monotonic Stack
- 32. Heap Patterns
- 33. Trie
- 34. Backtracking
- 35. Greedy
- 36. Intervals
- 37. Concurrency Problems
- 38. Design Problems
- 39. Hard Composites
- 40. Mock Interview Strategy