Prep Plan

FAANG Coding Interview Prep

A structured study plan covering the top 75 coding problems organized by pattern and difficulty. Master the most commonly asked problems at Google, Amazon, Meta, Apple, and Microsoft.

How to Use This Plan

Work through each category in order. Start with Easy problems to build pattern recognition, then progress to Medium and Hard. Mark each problem as complete to track your progress.

Phase 1: Fundamentals (Arrays, Strings, Hash Tables)

Build your foundation with the most common data structures.

Arrays

  1. Two Sum - Easy
  2. Best Time to Buy and Sell Stock - Easy
  3. Contains Duplicate - Easy
  4. Maximum Subarray - Medium
  5. Product of Array Except Self - Medium
  6. 3Sum - Medium
  7. Container With Most Water - Medium
  8. Merge Intervals - Medium
  9. Rotate Image - Medium
  10. Spiral Matrix - Medium

Strings

  1. Valid Anagram - Easy
  2. Valid Palindrome - Easy
  3. Longest Substring Without Repeating Characters - Medium
  4. Longest Palindromic Substring - Medium
  5. Group Anagrams - Medium
  6. Minimum Window Substring - Hard

Hash Tables

  1. Two Sum - Easy
  2. Valid Anagram - Easy
  3. Group Anagrams - Medium

Phase 2: Core Data Structures (Linked Lists, Stacks, Trees)

Linked Lists

  1. Reverse Linked List - Easy
  2. Merge Two Sorted Lists - Easy
  3. Linked List Cycle - Easy
  4. Remove Nth Node From End of List - Medium
  5. Reorder List - Medium
  6. Merge K Sorted Lists - Hard

Stacks & Queues

  1. Valid Parentheses - Easy
  2. Min Stack - Medium
  3. Daily Temperatures - Medium
  4. Largest Rectangle in Histogram - Hard

Trees

  1. Maximum Depth of Binary Tree - Easy
  2. Invert Binary Tree - Easy
  3. Same Tree - Easy
  4. Binary Tree Level Order Traversal - Medium
  5. Validate Binary Search Tree - Medium
  6. Kth Smallest Element in a BST - Medium
  7. Construct Binary Tree from Preorder and Inorder Traversal - Medium
  8. Binary Tree Maximum Path Sum - Hard
  9. Serialize and Deserialize Binary Tree - Hard

Phase 3: Algorithms (Graphs, DP, Heaps)

Graphs

  1. Number of Islands - Medium
  2. Clone Graph - Medium
  3. Course Schedule - Medium
  4. Pacific Atlantic Water Flow - Medium
  5. Graph Valid Tree - Medium
  6. Word Ladder - Hard

Dynamic Programming

  1. Climbing Stairs - Easy
  2. House Robber - Medium
  3. Coin Change - Medium
  4. Longest Increasing Subsequence - Medium
  5. Word Break - Medium
  6. Unique Paths - Medium
  7. Decode Ways - Medium

Heaps

  1. Kth Largest Element in an Array - Medium
  2. Top K Frequent Elements - Medium
  3. Find Median from Data Stream - Hard
  4. Merge K Sorted Lists - Hard

Phase 4: Advanced Patterns (Greedy, Backtracking, Bit Manipulation)

Sorting & Searching

  1. Search in Rotated Sorted Array - Medium
  2. Find Minimum in Rotated Sorted Array - Medium
  3. Median of Two Sorted Arrays - Hard

Greedy

  1. Jump Game - Medium
  2. Jump Game II - Medium

Backtracking

  1. Combination Sum - Medium
  2. Word Search - Medium

Bit Manipulation

  1. Number of 1 Bits - Easy
  2. Counting Bits - Easy
  3. Missing Number - Easy
  4. Reverse Bits - Easy

On this page