🎯Top Leetcode Questions for FAANG

This guide gives you the ultimate list of topic-wise leetcode questions for 14 weeks to crack FAANG interviews!

This 14-week LeetCode roadmap not only combines essential problems from NeetCode 150, Blind 75, and Striver's SDE Sheet, but it also covers all the recent FAANG interview questions!

The plan follows a day-wise structure with incremental difficulty—from easy to hard—ensuring steady progress without overwhelming you.

🗓️Week 1: Core Arrays + Subarrays

✅Day 1 – Basics

• Contains Duplicate

• Remove Duplicates from Sorted Array

• Find the Duplicate Number

✅Day 2 – Searching Pairs

• Two Sum

• Two Sum II – Input Array Is Sorted

• Find Pivot Index (Equilibrium Index)

✅Day 3 – Frequency & Majority

• Majority Element

• Maximum Subarray (Kadane's Algorithm)

✅Day 4 – Subarray with Given Sum

• Largest Subarray with Sum K (GFG)

• Longest Subarray with Sum K (GFG)

✅Day 5 – Prefix Sum / XOR

• Subarray Sum Equals K

• Count Subarrays with Given XOR (GFG)

✅Day 6 – Product + Sliding Window

• Maximum Product Subarray

• Minimum Size Subarray Sum

✅Day 7 – Triplets & Revision

• 3Sum

• Container With Most Water

• Practice: Solve 2 unseen array problems

---

🗓️Week 2: Medium/Hard Arrays

✅Day 8 – Tricky Transformations

• Next Permutation

• Sort Colors (Dutch National Flag)

• Set Mismatch

✅Day 9 – 2D Matrix Basics

• Set Matrix Zeroes

• Spiral Matrix

✅Day 10 – Rotation & Merge

• Rotate Image

• Merge Sorted Arrays Without Extra Space (GFG)

✅Day 11 – Greedy Stock

• Best Time to Buy and Sell Stock

• Max Consecutive Ones

✅Day 12 – Advanced Patterns

• Sliding Window Maximum

• Longest Consecutive Sequence

✅Day 13 – Mock + Notes

• Solve 3 medium/hard unseen array problems

• Make revision notes or cheatsheet

---

🗓️Week 3: Strings

✅Day 14 – Basics + Hashing

• Valid Anagram

• Isomorphic Strings

• Group Anagrams

• Valid Palindrome

✅Day 15 – Two Pointers

• Reverse String

• Reverse Words in a String

• Valid Palindrome II

• Longest Palindromic Substring

✅Day 16 – Sliding Window I

• Longest Substring Without Repeating Characters

• Minimum Window Substring

• Permutation in String

✅Day 17 – Sliding Window II

• Find All Anagrams in a String

• Longest Repeating Character Replacement

• Longest Substring with At Most K Distinct Characters

✅Day 18 – Stack + Pattern Matching

• Valid Parentheses

• Remove All Adjacent Duplicates In String

• Decode String

✅Day 19 – String Building + Greedy

• Implement strStr()

• Multiply Strings

• Remove K Digits

✅Day 20 – Expression Evaluation

• Count and Say

• Basic Calculator II

✅Day 21 – Mock & Practice

• Design Add and Search Words Data Structure

• Solve 2–3 unseen string problems

---

🗓️Week 4: Searching & Sorting

✅Day 22 – Binary Search Essentials

• Binary Search

• Find Peak Element

• Search Insert Position

✅Day 23 – Rotated Arrays

• Search in Rotated Sorted Array

• Find Minimum in Rotated Sorted Array

• Single Element in a Sorted Array

✅Day 24 – Matrix-Based Search

• Search a 2D Matrix

• Matrix Median

• Time Based Key-Value Store (binary search variant)

✅Day 25 – Binary Search Advanced

• Koko Eating Bananas

• Capacity To Ship Packages Within D Days

• Minimum Number of Days to Make m Bouquets

✅Day 26 – K-th & Median

• Median of Two Sorted Arrays

• K-th Element of Two Sorted Arrays

• Nth Root of an Integer

• Insert Interval (NEW)

• Merge Intervals (NEW)

✅Day 27 – Allocation Problems

• Allocate Minimum Number of Pages

• Book Allocation Problem

• Aggressive Cows

✅Day 28 – Revision + Mock

• Revisit Days 2 & 5

• Solve 2 unseen binary search problems

• Take 1 mock test (2 Medium, 1 Hard)

---

🗓️Week 5: Linked Lists

✅Day 29 – Basics

• Reverse Linked List

• Middle of the Linked List

• Merge Two Sorted Lists

✅Day 30 – Deletion & Intersection

• Remove Nth Node From End of List

• Delete Node in a Linked List

• Intersection of Two Linked Lists

✅Day 31 – Cycle & Palindrome

• Linked List Cycle

• Linked List Cycle II

• Palindrome Linked List

✅Day 32 – Arithmetic + Reordering

• Add Two Numbers

• Reorder List

• Rotate List

✅Day 33 – Group Reversal

• Reverse Linked List II

• Reverse Nodes in k-Group

✅Day 34 – Advanced Pointers

• Copy List with Random Pointer

• LRU Cache

• LFU Cache (optional advanced)

✅Day 35 – Mix & Test

• Merge k Sorted Lists

• Find the Duplicate Number (Floyd's Cycle Detection)

• Binary Tree to DLL (NEW)

---

🗓️Week 6: Stacks & Queues

✅Day 36 – Stack Basics

• Min Stack

• Implement Stack using Queues

• Valid Parentheses

✅Day 37 – Queue & Eval

• Implement Queue using Stacks

• Evaluate Reverse Polish Notation

• Daily Temperatures

✅Day 38 – NGE Patterns

• Next Greater Element I

• Next Greater Element II

• Next Smaller Element

• Stock Span Problem (optional)

✅Day 39 – Sliding Window

• Sliding Window Maximum

• First Negative Integer in Every Window

• Maximum of All Subarrays

✅Day 40 – Interview-Classics

• Largest Rectangle in Histogram

• Trapping Rain Water

• Minimum Add to Make Parentheses Valid

✅Day 41 – Greedy Stack

• Remove K Digits

• Decode String

• Simplify Path

✅Day 42 – System Design Style

• LRU Cache

• LFU Cache

• Insert Delete GetRandom O(1) (NEW)

---

🗓️Week 7: Trees & BSTs

✅Day 43 – Traversals

• Binary Tree Inorder Traversal

• Binary Tree Preorder Traversal

• Binary Tree Postorder Traversal

• Binary Tree Level Order Traversal

• Binary Tree Zigzag Level Order Traversal

✅Day 44 – Views

• Binary Tree Zigzag Level Order Traversal

• Binary Tree Right Side View

• Left View of Binary Tree

• Top View of Binary Tree

• Bottom View of Binary Tree

• Boundary Traversal of Binary Tree

✅Day 45 – Tree Properties

• Maximum Width of Binary Tree

• Maximum Depth of Binary Tree

• Diameter of Binary Tree

• Validate Binary Search Tree

✅Day 46 – Balance & Mirror

• Balanced Binary Tree

• Same Tree

• Symmetric Tree

• Invert Binary Tree

✅Day 47 – LCA & Search

• Lowest Common Ancestor of a Binary Tree

• Lowest Common Ancestor of a Binary Search Tree

• Search in a Binary Search Tree

✅Day 48 – Construction

• Construct Binary Tree from Preorder and Inorder Traversal

• Construct Binary Tree from Inorder and Postorder Traversal

• Construct Binary Search Tree from Preorder Traversal

• Flatten Binary Tree to Linked List

✅Day 49 – Special Topics

• Binary Tree Paths

• Inorder Successor in BST

• Populating Next Right Pointers in Each Node

• Print All Subsequences (NEW)

---

🗓️Week 8: Advanced Trees, Trie, Segment Trees

✅Day 50 – BST Kth & Iterator

• Kth Smallest Element in a BST

• Kth Largest Element in a Stream

• Binary Search Tree Iterator

✅Day 51 – Serialize + Subtree

• Serialize and Deserialize Binary Tree

• Subtree of Another Tree

• Count Good Nodes in Binary Tree

✅Day 52 – Segment Trees

• Range Minimum Query

• Segment Tree Build & Query

✅Day 53 – Trie

• Implement Trie (Prefix Tree)

• Design Add and Search Words Data Structure

✅Day 54 – Word Search Variants

• Word Search

• Word Search II

✅Day 55 – Advanced Trees

• Binary Tree Maximum Path Sum

• Diameter of Binary Tree (revisit if needed)

✅Day 56 – Revision

• Practice problems across trees, trie, segment tree

---

🗓️Week 9: Heaps / Priority Queue

✅Day 57 – Kth Pattern

• Kth Largest Element in an Array

• Kth Largest Element in a Stream

• Last Stone Weight

• K Closest Points to Origin

✅Day 58 – Top-K

• Top K Frequent Elements

• Top K Frequent Words

• Sort Characters By Frequency

• Rearrange String k Distance Apart

✅Day 59 – Frequency & Design

• Task Scheduler

• Design Twitter

• Reorganize String

• Maximum Frequency Stack (optional)

✅Day 60 – Streaming & Median

• Find Median from Data Stream

• Sliding Window Median

• Sliding Window Maximum

✅Day 61–62 – Design & Greedy

• LFU Cache

• LRU Cache

• IPO

• Merge k Sorted Lists

✅Day 63 – Bonus Problems

• Smallest Range Covering Elements from K Lists

• Meeting Rooms II

• Minimum Cost to Connect Sticks

---

🗓️Week 10–11: Graphs (2-Week Plan)

✅Day 64 – Traversals

• Depth-First Search

• Breadth-First Search

✅Day 65 – Cycle (Undirected)

• Detect Cycle in an Undirected Graph

✅Day 66 – Cycle (Directed)

• Detect Cycle in a Directed Graph

• Course Schedule (Kahn's Algorithm)

✅Day 67 – Topological Sort

• Topological Sorting

• Course Schedule

• Course Schedule II

✅Day 68 – Islands + Components

• Number of Islands

• Max Area of Island

• Number of Connected Components in an Undirected Graph

✅Day 69 – Advanced BFS/DFS

• Surrounded Regions

• Pacific Atlantic Water Flow

• Rotting Oranges

✅Day 70 – Coloring & Flood Fill

• Flood Fill

• Is Graph Bipartite?

✅Day 71 – Word Ladder

• Word Ladder

• Word Ladder II

✅Day 72 – Cloning + Alien

• Clone Graph

• Alien Dictionary

✅Day 73 – Shortest Paths

• Dijkstra's Algorithm

• Cheapest Flights Within K Stops

✅Day 74 – Hard Practice

• Word Ladder II

• Alien Dictionary

• M-Coloring Problem (NEW)

✅Day 75 – Revision

• Review all graph concepts & patterns

---

🗓️Week 12–13: Dynamic Programming

✅Day 76 – Recurrence Basics

• Climbing Stairs

• Minimum Cost Climbing Stairs

• Jump Game

• Jump Game II

✅Day 77 – Coin Change

• Coin Change

• Coin Change II

✅Day 78 – Robbery & Colors

• House Robber & House Robber II

• Paint House

✅Day 79 – Path + Decode

• Triangle

• Decode Ways

• Word Break

• Word Break II (NEW)

✅Day 80 – Subsequences

• Longest Increasing Subsequence

• Maximum Product Subarray

• Palindromic Substrings

• Longest Palindromic Substring

✅Day 81 – Grid Problems

• Unique Paths & Unique Paths II

• Minimum Path Sum

✅Day 82 – Subset & Partition

• Target Sum (Subset Sum Target)

• Partition Equal Subset Sum

• Palindrome Partitioning

• Palindrome Partitioning II

✅Day 83 – LCS & Edit

• Longest Common Subsequence

• Edit Distance

✅Day 84 – Knapsack

• Ones and Zeroes (0-1 Knapsack)

• Ones and Zeroes

• Rod Cutting Problem (NEW) - Classic DP problem, not on LeetCode

✅Day 85 – Matrix/Graph Paths

• Longest Increasing Path in a Matrix

✅Day 86 – Advanced

• Super Egg Drop (Egg Dropping Problem)

• Regular Expression Matching

• Burst Balloons

✅Day 87 – Revision

• Review all DP concepts & patterns

✅ Final Note

I know DSA can be overwhelming — but with the right plan and consistency, you can crack FAANG companies.

💼 Checkout my Resume guidence, to design a stellar resume for your job/internship applications!

Thanks for reading!
If you found this helpful, feel free to connect with me on:

📌Instagram(59K+),
📌LinkedIn(20K+) and
📌Youtube(20K+)