Most candidates can solve Arrays, Strings, and HashMaps.

The real difference-maker in FAANG interviews?

✅ Dynamic Programming
✅ Graphs

If you can confidently solve the problems below, you're already ahead of most interview candidates.

Happy Coding! 🚀

Dynamic Programming

• Climbing Stairs
• House Robber
• House Robber II
• Coin Change
• Coin Change II
• Decode Ways
• Unique Paths
• Minimum Path Sum
• Jump Game
• Jump Game II
• Longest Increasing Subsequence
• Longest Common Subsequence
• Word Break
• Partition Equal Subset Sum
• Target Sum
• Combination Sum IV
• Palindromic Substrings
• Longest Palindromic Substring
• Edit Distance
• Distinct Subsequences
• Best Time to Buy and Sell Stock
• Best Time to Buy and Sell Stock II
• Best Time to Buy and Sell Stock with Cooldown
• Maximum Product Subarray
• Burst Balloons

Graphs

• Number of Islands
• Clone Graph
• Course Schedule
• Course Schedule II
• Pacific Atlantic Water Flow
• Surrounded Regions
• Rotting Oranges
• Walls and Gates
• Graph Valid Tree
• Number of Connected Components in an Undirected Graph
• Alien Dictionary
• Reconstruct Itinerary
• Network Delay Time
• Cheapest Flights Within K Stops
• Min Cost to Connect All Points
• Path With Minimum Effort
• Accounts Merge
• Redundant Connection
• Critical Connections in a Network
• Word Ladder
• Open the Lock
• Evaluate Division
• Swim in Rising Water
• Bus Routes
• Shortest Path in Binary Matrix

Must Master Patterns

Dynamic Programming

✅ 1D DP

• Climbing Stairs
• House Robber

✅ 2D DP

• Unique Paths
• Minimum Path Sum

✅ Knapsack Pattern

• Partition Equal Subset Sum
• Target Sum

✅ Longest Increasing Subsequence (LIS)

• Longest Increasing Subsequence

✅ String DP

• Longest Common Subsequence
• Edit Distance
• Word Break

✅ Stock DP

• Best Time to Buy and Sell Stock
• Best Time to Buy and Sell Stock II
• Best Time to Buy and Sell Stock with Cooldown

Graphs

✅ BFS

• Number of Islands
• Rotting Oranges
• Word Ladder

✅ DFS

• Clone Graph
• Pacific Atlantic Water Flow

✅ Topological Sort

• Course Schedule
• Course Schedule II
• Alien Dictionary

✅ Union Find (Disjoint Set Union)

• Redundant Connection
• Number of Connected Components in an Undirected Graph

✅ Dijkstra's Algorithm

• Network Delay Time
• Path With Minimum Effort
• Cheapest Flights Within K Stops

✅ Minimum Spanning Tree (Prim / Kruskal)

• Min Cost to Connect All Points

⭐ Save this post for interview preparation.

💬 Which topic do you find harder: Dynamic Programming or Graphs?

CHECK OUT
🚀 Blind 75: The Only LeetCode List Most Interview Candidates Need

!!!