This kit is designed for FAANG-level Staff Software Engineer & Engineering Manager roles.
It covers core DSA, advanced patterns, system design, and leadership prep.
Solve 250–300 problems across these patterns for maximum coverage.
Must watch video - https://www.youtube.com/watch?v=WRA5OfeUP9I
- Subarray problems
- Kadane’s Algorithm
- Prefix / Suffix arrays
- Palindrome
- Two Pointer
- Pattern Matching → KMP, Rabin-Karp, Z-algorithm
- Anagram / Substring problems
- Expression Problems (Valid Parentheses, Min Stack, Expression Evaluation)
- Tree Traversal support
- Graph traversal support
- Monotonic Stack / Queue (Next Greater, Sliding Window Max)
- Deque (Double-ended Queue)
- Reverse a Linked List
- Detect a Loop
- Merge K Sorted Lists
- LRU Cache Implementation
- Frequency counting
- Caching / Memoization
- Traversals (Inorder, Preorder, Postorder, Level Order)
- Height, Diameter, Balance check
- Segment Tree / Fenwick Tree (Range Queries)
- Insert, Delete, Lookup
- BFS, DFS
- Balanced BST
- Lowest Common Ancestor
- Top K Problems
- Streaming Data (moving average, median)
- Dijkstra’s Shortest Path
- Scheduling & Load balancing (e.g., Zomato assigning nearest delivery person)
- DFS / BFS
- Topological Sort + Cycle Detection
- Shortest Path (Dijkstra, Bellman-Ford, Floyd-Warshall, A*)
- Minimum Spanning Tree (Kruskal / Prim)
- Connectivity with Union-Find
- Auto-complete
- Spell Check
- Word Search
- Longest Common Prefix
- Path Compression
- Union by Rank
- Dynamic connectivity problems
- DFS/BFS in 2D grids (Islands, Word Search, Shortest Path in Matrix)
- Merge Sort
- Quick Sort
- Selection Sort
- Heap Sort
- Classic binary search
- Variants (first/last occurrence, peak element, rotated sorted array)
- XOR tricks
- Bit Masking
- Subsets with bitmask
- State Compression DP
- DFS
- BFS
- Morris Traversal
- BFS, DFS
- Topological Sort
- Connected Components
- Dijkstra
- Bellman-Ford
- Floyd-Warshall
- A* (heuristics based)
- Reservoir Sampling
- Consistent Hashing
- Subarray problems
- Pattern Matching & Optimization
- Variable size window (Longest substring)
- Fixed size window (Max sum, moving averages)
- Range queries
- Difference array
- Cycle detection (Floyd’s)
- Middle of linked list
- Binary Search
- Merge Sort / Quick Sort
- Matrix Exponentiation
- Interval Scheduling
- Huffman Encoding
- Top K problems
- Dijkstra’s Algorithm
- Base cases & recursive tree
- Tail recursion
- N-Queens
- Sudoku Solver
- Subsets, Permutations
- Start with Recursion + Memoization
- 1D DP (Fibonacci, Climbing Stairs)
- 2D DP (Grid Paths, LCS)
- Knapsack, Coin Change
- State Compression DP (TSP, scheduling)
- Top K Elements
- Streaming Median
- Subset Sum
- Partition Problems
Placement Sheet ( https://docs.google.com/spreadsheets/d/16jJF7OohnOTGCCoqepDsv5FtnDwAG6Z1njvkcEHtHxw/edit?usp=sharing )
- Patterns: Sliding Window, Two Pointers, Prefix Sum, Kadane’s Algorithm
- Patterns: Reverse, Detect Cycle, Merge K Lists, LRU Cache
- Patterns: Min Stack, Valid Parentheses, Monotonic Stack, Queue via Stack
- Patterns: DFS, BFS, Diameter, LCA, Serialize/Deserialize
- Patterns: BFS/DFS, Dijkstra, Union-Find, Topological Sort
- Patterns: Fibonacci, Coin Change, Knapsack, Longest Subsequence, Matrix Path
- Patterns: Word Dictionary, Prefix Trees, MapSum, Word Search
- Patterns: N-Queens, Sudoku Solver, Subsets, Permutations
- Patterns: Interval Scheduling, Gas Station, Jump Game
- Patterns: Hashmaps, Heaps/Priority Queues, Bit Manipulation
✅ 250–300 problems across all categories.
Focus on patterns, not repetition — solving a balanced set across these topics will make you interview-ready for FAANG-level roles.
- Stack
- Queue
- Linked List
- Tries
- Binary Search Trees & Traversals
- Sliding Window
- Two Pointer
- Dynamic Programming
- Backtracking
- Greedy
- Kadane’s Algorithm
- Tower of Hanoi
- Graphs
- Heaps & Priority Queues
- Hashing & HashMaps
- Bit Manipulation
- Math & Combinatorics
- System Design (Critical for Staff/EM)
- Leadership & Behavioral Prep
- 20. Valid Parentheses
- 155. Min Stack
- 232. Implement Queue using Stacks
- 496. Next Greater Element I
- 739. Daily Temperatures
- 84. Largest Rectangle in Histogram
- 85. Maximal Rectangle
- 150. Evaluate Reverse Polish Notation
- 71. Simplify Path
- 227. Basic Calculator II
- 225. Implement Stack using Queues
- 622. Design Circular Queue
- 200. Number of Islands
- 994. Rotting Oranges
- 239. Sliding Window Maximum
- 346. Moving Average from Data Stream
- 362. Design Hit Counter
- 1091. Shortest Path in Binary Matrix
- 353. Design Snake Game
- 1696. Jump Game VI
- 206. Reverse Linked List - Done
- 21. Merge Two Sorted Lists - Done
- 141. Linked List Cycle - Done
- 19. Remove Nth Node From End of List - Done
- 2. Add Two Numbers
- 430. Flatten a Multilevel Doubly Linked List
- 143. Reorder List
- 146. LRU Cache
- 23. Merge k Sorted Lists
- 138. Copy List with Random Pointer
- 208. Implement Trie (Prefix Tree)
- 212. Word Search II
- 211. Design Add and Search Words Data Structure
- 642. Design Search Autocomplete System
- 648. Replace Words
- 745. Prefix and Suffix Search
- 421. Maximum XOR of Two Numbers in an Array
- 336. Palindrome Pairs
- 720. Longest Word in Dictionary
- 1032. Stream of Characters
- 104. Maximum Depth of Binary Tree
- 101. Symmetric Tree
- 102. Binary Tree Level Order Traversal
- 98. Validate Binary Search Tree
- 236. Lowest Common Ancestor of a Binary Tree
- 297. Serialize and Deserialize Binary Tree
- 124. Binary Tree Maximum Path Sum
- 99. Recover Binary Search Tree
- 222. Count Complete Tree Nodes
- 230. Kth Smallest Element in a BST
- 643. Maximum Average Subarray I
- 209. Minimum Size Subarray Sum
- 3. Longest Substring Without Repeating Characters
- 567. Permutation in String
- 424. Longest Repeating Character Replacement
- 239. Sliding Window Maximum
- 76. Minimum Window Substring
- 1004. Max Consecutive Ones III
- 713. Subarray Product Less Than K
- 438. Find All Anagrams in a String
- 125. Valid Palindrome
- 167. Two Sum II - Input Array Is Sorted
- 26. Remove Duplicates from Sorted Array
- 11. Container With Most Water
- 15. 3Sum
- 75. Sort Colors
- 42. Trapping Rain Water
- 727. Minimum Window Subsequence
- 88. Merge Sorted Array
- 845. Longest Mountain in Array
- 70. Climbing Stairs
- 198. House Robber
- 322. Coin Change
- 62. Unique Paths
- 300. Longest Increasing Subsequence
- 72. Edit Distance
- 139. Word Break
- 647. Palindromic Substrings
- 64. Minimum Path Sum
- 10. Regular Expression Matching
- 78. Subsets
- 46. Permutations
- 39. Combination Sum
- 79. Word Search
- 131. Palindrome Partitioning
- 37. Sudoku Solver
- 51. N-Queens
- 22. Generate Parentheses
- 17. Letter Combinations of a Phone Number
- Classic: Rat in a Maze (not on LeetCode — practice separately)
- 455. Assign Cookies
- 55. Jump Game
- 45. Jump Game II
- 134. Gas Station
- 135. Candy
- 435. Non-overlapping Intervals
- 763. Partition Labels
- 452. Minimum Number of Arrows to Burst Balloons
- Classic: Huffman Coding (practice separately)
- Classic: Activity Selection Problem (practice separately)
- 53. Maximum Subarray
- 918. Maximum Sum Circular Subarray
- 643. Maximum Average Subarray I
- 363. Max Sum of Rectangle No Larger Than K
- 121. Best Time to Buy and Sell Stock
- 122. Best Time to Buy and Sell Stock II
- 123. Best Time to Buy and Sell Stock III
- 152. Maximum Product Subarray
- 523. Continuous Subarray Sum
- 673. Number of Longest Increasing Subsequence
- Classic: Tower of Hanoi recursion (not on LeetCode)
- Print all steps of Tower of Hanoi (custom implementation)
- Variants: 4 Pegs (research problem, not on LeetCode)
- 133. Clone Graph
- 200. Number of Islands
- 207. Course Schedule
- 210. Course Schedule II
- 785. Is Graph Bipartite?
- 684. Redundant Connection
- 261. Graph Valid Tree
- 743. Network Delay Time
- 787. Cheapest Flights Within K Stops
- 778. Swim in Rising Water
- 215. Kth Largest Element in an Array
- 378. Kth Smallest Element in a Sorted Matrix
- 23. Merge k Sorted Lists
- 295. Find Median from Data Stream
- 347. Top K Frequent Elements
- 621. Task Scheduler
- 767. Reorganize String
- 239. Sliding Window Maximum
- 1167. Minimum Cost to Connect Sticks
- 264. Ugly Number II
- 1. Two Sum
- 560. Subarray Sum Equals K
- 128. Longest Consecutive Sequence
- 49. Group Anagrams
- 205. Isomorphic Strings
- 146. LRU Cache
- 706. Design HashMap
- 380. Insert Delete GetRandom O(1)
- 652. Find Duplicate Subtrees
- 290. Word Pattern
- 136. Single Number
- 137. Single Number II
- 260. Single Number III
- 78. Subsets (bitmask approach)
- 231. Power of Two
- 338. Counting Bits
- 190. Reverse Bits
- 201. Bitwise AND of Numbers Range
- 421. Maximum XOR of Two Numbers in an Array
- 1178. Number of Valid Words for Each Puzzle
- 202. Happy Number
- 204. Count Primes
- 50. Pow(x, n)
- 7. Reverse Integer
- 9. Palindrome Number
- 172. Factorial Trailing Zeroes
- 233. Number of Digit One
- 400. Nth Digit
- 43. Multiply Strings
- 66. Plus One
- URL Shortener
- Twitter/Instagram/WhatsApp
- Google Docs (collaborative editing)
- YouTube recommendation system
- Distributed cache
- Parking Lot System
- Elevator System
- Food Delivery App
- Rate Limiter
- Notification System
- Load balancing, sharding, replication
- CAP theorem, consistency models
- Message queues (Kafka, RabbitMQ, SQS)
- Caching strategies (LRU, LFU, write-through, write-back)
- CDN design (CloudFront, Akamai)
- Mentoring & growing engineers
- Driving cross-team initiatives
- Handling ambiguity and prioritization
- Conflict resolution & communication
- Delivering impact at org level
Practice STAR Method Stories:
- Scaling systems you built (e.g., Zoom/VMware projects)
- Mentorship examples (juniors → seniors)
- Cross-functional collaboration (PMs, designers, customers)
- Driving innovation (AI agents, serverless infra, etc.)
- 141. Linked List Cycle
- 142. Linked List Cycle II
- 876. Middle of the Linked List
- 234. Palindrome Linked List
- 382. Linked List Random Node
- 33. Search in Rotated Sorted Array
- 34. Find First and Last Position of Element in Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 162. Find Peak Element
- 215. Kth Largest Element in an Array
- 410. Split Array Largest Sum
- 875. Koko Eating Bananas
- 164. Maximum Gap
- (Concept) Counting Sort / Radix Sort / Bucket Sort
- (Concept) Morris Traversal (O(1) space inorder)
- 199. Binary Tree Right Side View
- 103. Binary Tree Zigzag Level Order Traversal
- 684. Redundant Connection
- 261. Graph Valid Tree
- 1192. Critical Connections in a Network
- (Concept) Kosaraju’s Algorithm (SCCs)
- 743. Network Delay Time
- 1514. Path with Maximum Probability
- 787. Cheapest Flights Within K Stops
- 1631. Path With Minimum Effort
- 1584. Min Cost to Connect All Points
- (Concept) Floyd–Warshall (All-pairs shortest path)
- 1143. Longest Common Subsequence
- 516. Longest Palindromic Subsequence
- 72. Edit Distance
- 416. Partition Equal Subset Sum
- 494. Target Sum
- 139. Word Break
- 691. Stickers to Spell Word
- (Concept) Matrix Chain Multiplication
- (Concept) Digit DP (counting with digit constraints)
- 56. Merge Intervals
- 253. Meeting Rooms II
- 435. Non-overlapping Intervals
- 452. Minimum Number of Arrows to Burst Balloons
- 763. Partition Labels
- 135. Candy
- 45. Jump Game II
- 204. Count Primes
- 50. Pow(x, n)
- 372. Super Pow
- 365. Water and Jug Problem
- 268. Missing Number
- 233. Number of Digit One
- 28. Find the Index of the First Occurrence in a String
- 686. Repeated String Match
- 5. Longest Palindromic Substring
- 214. Shortest Palindrome
- 68. Text Justification
- 49. Group Anagrams
- 496. Next Greater Element I
- 503. Next Greater Element II
- 739. Daily Temperatures
- 84. Largest Rectangle in Histogram
- 239. Sliding Window Maximum
- 307. Range Sum Query – Mutable
- 315. Count of Smaller Numbers After Self
- 327. Count of Range Sum
- 218. The Skyline Problem
- 421. Maximum XOR of Two Numbers in an Array