Meta LeetCode 5-Day Preparation Plan: Intensive Coding Interview Prep

A structured 5-day intensive preparation plan for Meta coding interviews, covering all essential topics with 7-10 carefully selected problems per day.

Overview

Target Audience: Software engineers preparing for Meta (Facebook) coding interviews
Time Commitment: 4-6 hours per day
Format: Mix of Easy, Medium, and Hard problems
Focus Areas: Meta’s most frequently asked question types

Day 1: Arrays, Strings & Two Pointers

Focus: Foundation problems that appear frequently in Meta interviews

Sub-categories:

  1. Two Pointers & Sliding Window
  2. String Manipulation & Validation
  3. Array Operations & Sorting
  4. Hash Tables & Prefix Sum

1. Two Pointers & Sliding Window

  1. Two Sum (Easy, 56.5%)
  2. 167. Two Sum II - Input Array Is Sorted (Medium, 64.1%)
  3. 3Sum (Medium, 37.9%)
  4. 16. 3Sum Closest (Medium, 47.5%)
  5. 18. 4Sum (Medium, 39.2%)
  6. Container With Most Water (Medium, 58.9%)
  7. Minimum Window Substring (Hard, 46.3%)
  8. 424. Longest Repeating Character Replacement (Medium, 58.3%)
  9. 3. Longest Substring Without Repeating Characters (Medium, 37.8%)
  10. 1004. Max Consecutive Ones III (Medium, 66.8%)
  11. 485. Max Consecutive Ones (Easy, 63.6%)
  12. 239. Sliding Window Maximum (Hard, 48.1%)
  13. 480. Sliding Window Median (Hard, 38.8%)
  14. 1423. Maximum Points You Can Obtain from Cards (Medium, 56.7%)
  15. 525. Contiguous Array (Medium, 50.1%)

2. String Manipulation & Validation

  1. Valid Parentheses (Easy, 43.1%)
  2. 921. Minimum Add to Make Parentheses Valid (Medium, 74.5%)
  3. 1249. Minimum Remove to Make Valid Parentheses (Medium, 71.1%)
  4. 678. Valid Parenthesis String (Medium, 39.5%)
  5. Valid Palindrome (Easy, 52.1%)
  6. Valid Palindrome II (Easy, 43.6%)
  7. 1216. Valid Palindrome III (Hard, 49.1%)
  8. 234. Palindrome Linked List (Easy, 56.8%)
  9. 647. Palindromic Substrings (Medium, 72.2%)
  10. 5. Longest Palindromic Substring (Medium, 36.7%)
  11. Group Anagrams (Medium, 71.7%)
  12. 242. Valid Anagram (Easy, 67.3%)
  13. 249. Group Shifted Strings (Medium, 67.6%)
  14. 791. Custom Sort String (Medium, 72.2%)
  15. 451. Sort Characters By Frequency (Medium, 74.8%)
  16. 394. Decode String (Medium, 61.8%)
  17. 227. Basic Calculator II (Medium, 46.3%)
  18. 224. Basic Calculator (Hard, 46.3%)
  19. 71. Simplify Path (Medium, 49.2%)
  20. 415. Add Strings (Easy, 52.0%)
  21. 67. Add Binary (Easy, 56.4%)
  22. 8. String to Integer (atoi) (Medium, 20.0%)
  23. 65. Valid Number (Hard, 22.2%)
  24. 468. Validate IP Address (Medium, 28.0%)
  25. 408. Valid Word Abbreviation (Easy, 37.0%)
  26. 246. Strobogrammatic Number (Easy, 47.6%)
  27. 205. Isomorphic Strings (Easy, 47.6%)
  28. 14. Longest Common Prefix (Easy, 46.5%)
  29. 9. Palindrome Number (Easy, 59.8%)
  30. 7. Reverse Integer (Medium, 31.0%)
  31. 13. Roman to Integer (Easy, 65.7%)
  32. 58. Length of Last Word (Easy, 57.5%)
  33. 796. Rotate String (Easy, 64.6%)
  34. 344. Reverse String (Easy, 80.2%)
  35. 345. Reverse Vowels of a String (Easy, 59.7%)
  36. 1047. Remove All Adjacent Duplicates In String (Easy, 72.3%)
  37. 1209. Remove All Adjacent Duplicates in String II (Medium, 60.4%)
  38. 1910. Remove All Occurrences of a Substring (Medium, 78.3%)
  39. 443. String Compression (Medium, 59.0%)
  40. 824. Goat Latin (Easy, 69.7%)
  41. 3461. Check If Digits Are Equal in String After Operations I (Easy, 82.5%)
  42. 1781. Sum of Beauty of All Substrings (Medium, 72.8%)

3. Array Operations & Sorting

  1. Merge Sorted Array (Easy, 53.8%)
  2. 21. Merge Two Sorted Lists (Easy, 67.5%)
  3. 986. Interval List Intersections (Medium, 72.8%)
  4. Merge Intervals (Medium, 50.4%)
  5. 253. Meeting Rooms II (Medium, 52.4%)
  6. 26. Remove Duplicates from Sorted Array (Easy, 61.5%)
  7. 27. Remove Element (Easy, 60.8%)
  8. 283. Move Zeroes (Easy, 63.2%)
  9. 189. Rotate Array (Medium, 43.9%)
  10. 48. Rotate Image (Medium, 78.8%)
  11. 867. Transpose Matrix (Easy, 75.2%)
  12. 54. Spiral Matrix (Medium, 55.3%)
  13. 498. Diagonal Traverse (Medium, 66.7%)
  14. 73. Set Matrix Zeroes (Medium, 61.8%)
  15. 766. Toeplitz Matrix (Easy, 69.5%)
  16. 31. Next Permutation (Medium, 44.1%)
  17. 556. Next Greater Element III (Medium, 34.9%)
  18. 75. Sort Colors (Medium, 68.5%)
  19. 905. Sort Array By Parity (Easy, 76.4%)
  20. 896. Monotonic Array (Easy, 62.0%)
  21. 118. Pascal’s Triangle (Easy, 78.3%)
  22. 66. Plus One (Easy, 48.3%)
  23. 2235. Add Two Integers (Easy, 87.8%)
  24. 53. Maximum Subarray (Medium, 52.6%)
  25. 2348. Number of Zero-Filled Subarrays (Medium, 70.2%)
  26. 605. Can Place Flowers (Easy, 29.0%)
  27. 1431. Kids With the Greatest Number of Candies (Easy, 88.1%)
  28. 3354. Make Array Elements Equal to Zero (Easy, 68.4%)
  29. 1877. Minimize Maximum Pair Sum in Array (Medium, 81.6%)
  30. 3158. Find the XOR of Numbers Which Appear Twice (Easy, 78.3%)
  31. 3005. Count Elements With Maximum Frequency (Easy, 79.9%)
  32. 3346. Maximum Frequency of an Element After Performing Operations I (Medium, 39.9%)
  33. 3494. Find the Minimum Amount of Time to Brew Potions (Medium, 62.7%)
  34. 3477. Fruits Into Baskets II (Easy, 70.3%)
  35. 3541. Find Most Frequent Vowel and Consonant (Easy, 89.8%)
  36. 3697. Compute Decimal Representation (Easy, 60.3%)
  37. 2749. Minimum Operations to Make the Integer Zero (Medium, 58.2%)
  38. 2048. Next Greater Numerically Balanced Number (Medium, 62.9%)
  39. 163. Missing Ranges (Easy, 35.5%)
  40. 1539. Kth Missing Positive Number (Easy, 62.9%)
  41. 1060. Missing Element in Sorted Array (Medium, 59.5%)
  42. 268. Missing Number (Easy, 71.0%)
  43. 169. Majority Element (Easy, 65.9%)
  44. 219. Contains Duplicate II (Easy, 50.0%)
  45. 217. Contains Duplicate (Easy, 63.7%)
  46. 287. Find the Duplicate Number (Medium, 63.6%)
  47. 1207. Unique Number of Occurrences (Easy, 78.5%)
  48. 724. Find Pivot Index (Easy, 61.4%)
  49. 303. Range Sum Query - Immutable (Easy, 70.2%)
  50. 1352. Product of the Last K Numbers (Medium, 62.8%)
  51. 1868. Product of Two Run-Length Encoded Arrays (Medium, 59.5%)
  52. 1865. Finding Pairs With a Certain Sum (Medium, 61.7%)
  53. 973. K Closest Points to Origin (Medium, 68.4%)
  54. 658. Find K Closest Elements (Medium, 49.2%)
  55. 670. Maximum Swap (Medium, 51.9%)
  56. 42. Trapping Rain Water (Hard, 66.1%)
  57. 1762. Buildings With an Ocean View (Medium, 80.9%)
  58. 134. Gas Station (Medium, 47.1%)
  59. 825. Friends Of Appropriate Ages (Medium, 49.5%)
  60. 1094. Car Pooling (Medium, 56.1%)
  61. 636. Exclusive Time of Functions (Medium, 65.4%)
  62. 46. Permutations (Medium, 81.3%)
  63. 90. Subsets II (Medium, 60.4%)
  64. 78. Subsets (Medium, 81.6%)
  65. 784. Letter Case Permutation (Medium, 75.5%)
  66. 496. Next Greater Element I (Easy, 75.3%)
  67. 735. Asteroid Collision (Medium, 46.3%)
  68. 907. Sum of Subarray Minimums (Medium, 38.0%)
  69. 84. Largest Rectangle in Histogram (Hard, 48.6%)
  70. 218. The Skyline Problem (Hard, 44.5%)
  71. 2257. Count Unguarded Cells in the Grid (Medium, 69.2%)
  72. 1652. Defuse the Bomb (Easy, 79.3%)
  73. 1331. Rank Transform of an Array (Easy, 70.7%)

4. Hash Tables & Prefix Sum

  1. 560. Subarray Sum Equals K (Medium, 46.2%)
  2. 523. Continuous Subarray Sum (Medium, 31.1%)
  3. 1570. Dot Product of Two Sparse Vectors (Medium, 89.9%)
  4. 349. Intersection of Two Arrays (Easy, 77.1%)
  5. 350. Intersection of Two Arrays II (Easy, 59.4%)
  6. 706. Design HashMap (Easy, 66.1%)
  7. 1160. Find Words That Can Be Formed by Characters (Easy, 71.3%)
  8. 781. Rabbits in Forest (Medium, 58.1%)
  9. 202. Happy Number (Easy, 58.8%)
  10. 136. Single Number (Easy, 76.8%)
  11. 540. Single Element in a Sorted Array (Medium, 59.2%)

Day 1 Study Tips

  • Master the two-pointer technique (left-right pointers)
  • Practice hash map usage for O(1) lookups
  • Understand sliding window patterns

Day 2: Trees, Graphs & Traversal

Focus: Tree and graph problems that test recursive thinking

Sub-categories:

  1. Binary Trees
  2. Binary Search Trees
  3. Graph Traversal
  4. Grid & Matrix Problems

1. Binary Trees

  1. Binary Tree Level Order Traversal (Medium, 71.6%)
  2. 107. Binary Tree Level Order Traversal II (Medium, 67.0%)
  3. Diameter of Binary Tree (Easy, 64.5%)
  4. Binary Tree Right Side View (Medium, 68.6%)
  5. Binary Tree Vertical Order Traversal (Medium, 57.6%)
  6. 987. Vertical Order Traversal of a Binary Tree (Hard, 52.6%)
  7. Lowest Common Ancestor of a Binary Tree (Medium, 68.0%)
  8. Lowest Common Ancestor of a Binary Tree III (Medium, 82.8%)
  9. 1123. Lowest Common Ancestor of Deepest Leaves (Medium, 79.0%)
  10. 124. Binary Tree Maximum Path Sum (Hard, 41.7%)
  11. 129. Sum Root to Leaf Numbers (Medium, 69.2%)
  12. 2265. Count Nodes Equal to Average of Subtree (Medium, 86.7%)
  13. 863. All Nodes Distance K in Binary Tree (Medium, 67.1%)
  14. 545. Boundary of Binary Tree (Medium, 47.6%)
  15. 116. Populating Next Right Pointers in Each Node (Medium, 66.3%)
  16. 114. Flatten Binary Tree to Linked List (Medium, 69.6%)
  17. 100. Same Tree (Easy, 66.1%)
  18. 617. Merge Two Binary Trees (Easy, 78.9%)
  19. 110. Balanced Binary Tree (Easy, 56.4%)
  20. 958. Check Completeness of a Binary Tree (Medium, 58.8%)
  21. 297. Serialize and Deserialize Binary Tree (Hard, 59.8%)
  22. 536. Construct Binary Tree from String (Medium, 58.6%)
  23. 1443. Minimum Time to Collect All Apples in a Tree (Medium, 63.4%)

2. Binary Search Trees

  1. Range Sum of BST (Easy, 87.5%)
  2. 270. Closest Binary Search Tree Value (Easy, 49.4%)
  3. 235. Lowest Common Ancestor of a Binary Search Tree (Medium, 69.4%)
  4. 98. Validate Binary Search Tree (Medium, 35.0%)
  5. 426. Convert Binary Search Tree to Sorted Doubly Linked List (Medium, 65.6%)
  6. 173. Binary Search Tree Iterator (Medium, 75.7%)

3. Graph Traversal

  1. Course Schedule (Medium, 50.2%)
  2. 210. Course Schedule II (Medium, 54.4%)
  3. 133. Clone Graph (Medium, 63.8%)
  4. 127. Word Ladder (Hard, 44.1%)
  5. 126. Word Ladder II (Hard, 27.3%)
  6. 269. Alien Dictionary (Hard, 36.9%)
  7. 721. Accounts Merge (Medium, 60.4%)
  8. 752. Open the Lock (Medium, 60.9%)
  9. 286. Walls and Gates (Medium, 63.4%)
  10. 317. Shortest Distance from All Buildings (Hard, 44.7%)
  11. 417. Pacific Atlantic Water Flow (Medium, 60.1%)

4. Grid & Matrix Problems

  1. Number of Islands (Medium, 63.2%)
  2. 695. Max Area of Island (Medium, 73.5%)
  3. 827. Making A Large Island (Hard, 55.8%)
  4. 934. Shortest Bridge (Medium, 59.0%)
  5. 1091. Shortest Path in Binary Matrix (Medium, 50.7%)
  6. 1293. Shortest Path in a Grid with Obstacles Elimination (Hard, 45.9%)
  7. 130. Surrounded Regions (Medium, 44.1%)
  8. 542. 01 Matrix (Medium, 52.7%)
  9. 329. Longest Increasing Path in a Matrix (Hard, 55.9%)
  10. 994. Rotting Oranges (Medium, 57.6%)
  11. 419. Battleships in a Board (Medium, 77.0%)
  12. 778. Swim in Rising Water (Hard, 67.3%)
  13. 240. Search a 2D Matrix II (Medium, 56.2%)
  14. 378. Kth Smallest Element in a Sorted Matrix (Medium, 64.0%)
  15. 311. Sparse Matrix Multiplication (Medium, 69.1%)
  16. 36. Valid Sudoku (Medium, 63.7%)
  17. 37. Sudoku Solver (Hard, 65.3%)

Day 2 Study Tips

  • Master recursive DFS patterns
  • Understand BFS queue-based traversal
  • Practice graph representation (adjacency list/matrix)
  • Learn topological sort for DAG problems

Day 3: Dynamic Programming & Advanced String

Focus: DP problems and advanced string manipulation

Sub-categories:

  1. 1D Dynamic Programming
  2. 2D Dynamic Programming
  3. String DP & Matching
  4. Math & Combinatorics

1. 1D Dynamic Programming

  1. Climbing Stairs (Easy, 53.7%)
  2. 746. Min Cost Climbing Stairs (Easy, 67.7%)
  3. Best Time to Buy and Sell Stock (Easy, 55.9%)
  4. 122. Best Time to Buy and Sell Stock II (Medium, 70.2%)
  5. 123. Best Time to Buy and Sell Stock III (Hard, 52.4%)
  6. 3652. Best Time to Buy and Sell Stock using Strategy (Medium, 44.5%)
  7. 198. House Robber (Medium, 52.7%)
  8. 213. House Robber II (Medium, 44.2%)
  9. 53. Maximum Subarray (Medium, 52.6%)
  10. 322. Coin Change (Medium, 47.4%)
  11. 494. Target Sum (Medium, 51.4%)
  12. 416. Partition Equal Subset Sum (Medium, 48.9%)
  13. 983. Minimum Cost For Tickets (Medium, 67.4%)
  14. 1039. Minimum Score Triangulation of Polygon (Medium, 67.3%)
  15. 32. Longest Valid Parentheses (Hard, 37.3%)
  16. 301. Remove Invalid Parentheses (Hard, 49.5%)
  17. 402. Remove K Digits (Medium, 35.9%)
  18. 62. Unique Paths (Medium, 66.2%)
  19. 63. Unique Paths II (Medium, 37.8%)
  20. 343. Integer Break (Medium, 61.5%)

2. 2D Dynamic Programming

  1. Longest Common Subsequence (Medium, 58.6%)
  2. Longest Palindromic Substring (Medium, 36.7%)
  3. 647. Palindromic Substrings (Medium, 72.2%)
  4. Regular Expression Matching (Hard, 29.9%)
  5. 44. Wildcard Matching (Hard, 27.0%)
  6. 72. Edit Distance (Hard, 50.0%)
  7. 97. Interleaving String (Medium, 37.0%)
  8. 115. Distinct Subsequences (Hard, 41.9%)
  9. 300. Longest Increasing Subsequence (Medium, 50.0%)
  10. 329. Longest Increasing Path in a Matrix (Hard, 55.9%)
  11. 221. Maximal Square (Medium, 43.0%)

3. String DP & Matching

  1. 394. Decode String (Medium, 61.8%)
  2. 91. Decode Ways (Medium, 32.5%)
  3. 139. Word Break (Medium, 43.9%)
  4. 140. Word Break II (Hard, 40.7%)
  5. 282. Expression Add Operators (Hard, 42.4%)
  6. 679. 24 Game (Hard, 59.2%)
  7. 4. Median of Two Sorted Arrays (Hard, 45.1%)

4. Math & Combinatorics

  1. 50. Pow(x, n) (Medium, 37.8%)
  2. 69. Sqrt(x) (Easy, 41.0%)
  3. 29. Divide Two Integers (Medium, 19.0%)
  4. 231. Power of Two (Easy, 49.5%)
  5. 319. Bulb Switcher (Medium, 55.0%)
  6. 204. Count Primes (Medium, 35.4%)
  7. 166. Fraction to Recurring Decimal (Medium, 30.1%)
  8. 1922. Count Good Numbers (Medium, 57.1%)
  9. 2954. Count the Number of Infection Sequences (Hard, 35.6%)
  10. 2300. Successful Pairs of Spells and Potions (Medium, 49.2%)
  11. 976. Largest Perimeter Triangle (Easy, 61.6%)
  12. 1011. Capacity To Ship Packages Within D Days (Medium, 73.0%)

Day 3 Study Tips

  • Learn DP patterns: 1D, 2D, state machines
  • Practice memoization vs tabulation
  • Understand optimal substructure and overlapping subproblems
  • Master space optimization techniques

Day 4: Hash Tables, Linked Lists & Design

Focus: Advanced data structures and design patterns

Sub-categories:

  1. Hash Tables & Design
  2. Linked Lists
  3. Heaps & Priority Queues
  4. Stack & Queue

1. Hash Tables & Design

  1. LRU Cache (Medium, 46.2%)
  2. 380. Insert Delete GetRandom O(1) (Medium, 55.1%)
  3. 706. Design HashMap (Easy, 66.1%)
  4. 348. Design Tic-Tac-Toe (Medium, 58.7%)
  5. 346. Moving Average from Data Stream (Easy, 80.1%)
  6. 295. Find Median from Data Stream (Hard, 53.8%)
  7. 1206. Design Skiplist (Hard, 58.7%)
  8. 2043. Simple Bank System (Medium, 70.2%)
  9. Top K Frequent Elements (Medium, 65.1%)
  10. 692. Top K Frequent Words (Medium, 59.7%)
  11. 528. Random Pick with Weight (Medium, 48.7%)
  12. 398. Random Pick Index (Medium, 64.8%)
  13. 1570. Dot Product of Two Sparse Vectors (Medium, 89.9%)
  14. 1865. Finding Pairs With a Certain Sum (Medium, 61.7%)
  15. 339. Nested List Weight Sum (Medium, 85.8%)
  16. 341. Flatten Nested List Iterator (Medium, 65.4%)

2. Linked Lists

  1. Add Two Numbers (Medium, 47.2%)
  2. 21. Merge Two Sorted Lists (Easy, 67.5%)
  3. 23. Merge k Sorted Lists (Hard, 58.1%)
  4. Remove Nth Node From End of List (Medium, 50.2%)
  5. Copy List with Random Pointer (Medium, 61.7%)
  6. Reverse Linked List II (Medium, 50.4%)
  7. 206. Reverse Linked List (Easy, 79.9%)
  8. Intersection of Two Linked Lists (Easy, 62.4%)
  9. 234. Palindrome Linked List (Easy, 56.8%)
  10. 237. Delete Node in a Linked List (Medium, 83.2%)
  11. 328. Odd Even Linked List (Medium, 62.1%)
  12. 61. Rotate List (Medium, 40.7%)
  13. 708. Insert into a Sorted Circular Linked List (Medium, 38.4%)
  14. 147. Insertion Sort List (Medium, 57.5%)
  15. 148. Sort List (Medium, 63.1%)
  16. 1721. Swapping Nodes in a Linked List (Medium, 68.9%)

3. Heaps & Priority Queues

  1. 215. Kth Largest Element in an Array (Medium, 68.5%)
  2. 973. K Closest Points to Origin (Medium, 68.4%)
  3. 658. Find K Closest Elements (Medium, 49.2%)
  4. 378. Kth Smallest Element in a Sorted Matrix (Medium, 64.0%)
  5. 703. Kth Largest Element in a Stream (Easy, 55.5%)
  6. 1046. Last Stone Weight (Easy, 65.1%)
  7. 767. Reorganize String (Medium, 52.0%)

4. Stack & Queue

  1. 20. Valid Parentheses (Easy, 43.1%)
  2. 1249. Minimum Remove to Make Valid Parentheses (Medium, 71.1%)
  3. 921. Minimum Add to Make Parentheses Valid (Medium, 74.5%)
  4. 678. Valid Parenthesis String (Medium, 39.5%)
  5. 394. Decode String (Medium, 61.8%)
  6. 227. Basic Calculator II (Medium, 46.3%)
  7. 224. Basic Calculator (Hard, 46.3%)
  8. 636. Exclusive Time of Functions (Medium, 65.4%)
  9. 735. Asteroid Collision (Medium, 46.3%)
  10. 496. Next Greater Element I (Easy, 75.3%)
  11. 503. Next Greater Element II (Medium, 64.0%)
  12. 739. Daily Temperatures (Medium, 67.0%)
  13. 84. Largest Rectangle in Histogram (Hard, 48.6%)
  14. 1762. Buildings With an Ocean View (Medium, 80.9%)
  15. 907. Sum of Subarray Minimums (Medium, 38.0%)
  16. 1047. Remove All Adjacent Duplicates In String (Easy, 72.3%)
  17. 1209. Remove All Adjacent Duplicates in String II (Medium, 60.4%)
  18. 71. Simplify Path (Medium, 49.2%)
  19. 150. Evaluate Reverse Polish Notation (Medium, 45.0%)
  20. 155. Min Stack (Medium, 52.6%)
  21. 232. Implement Queue using Stacks (Easy, 61.0%)
  22. 225. Implement Stack using Queues (Easy, 69.4%)
  23. 239. Sliding Window Maximum (Hard, 48.1%)
  24. 480. Sliding Window Median (Hard, 38.8%)
  25. 346. Moving Average from Data Stream (Easy, 80.1%)
  26. 933. Number of Recent Calls (Easy, 75.8%)
  27. 622. Design Circular Queue (Medium, 50.9%)

Day 4 Study Tips

  • Master sliding window patterns (fixed/variable size)
  • Understand hash map for O(1) operations
  • Practice linked list pointer manipulation
  • Learn design patterns for data structures

Day 5: Backtracking, Binary Search & Advanced Patterns

Focus: Complex recursive problems and optimization techniques

Sub-categories:

  1. Backtracking
  2. Binary Search
  3. Bit Manipulation
  4. Divide & Conquer

1. Backtracking

  1. Subsets (Medium, 81.6%)
  2. 90. Subsets II (Medium, 60.4%)
  3. 46. Permutations (Medium, 81.3%)
  4. 47. Permutations II (Medium, 56.1%)
  5. 22. Generate Parentheses (Medium, 77.9%)
  6. 17. Letter Combinations of a Phone Number (Medium, 60.1%)
  7. 784. Letter Case Permutation (Medium, 75.5%)
  8. 51. N-Queens (Hard, 74.2%)
  9. 52. N-Queens II (Hard, 70.0%)
  10. Word Search (Medium)
  11. 212. Word Search II (Hard, 37.1%)
  12. Robot Room Cleaner (Hard, 77.7%)
  13. 131. Palindrome Partitioning (Medium, 64.3%)
  14. 93. Restore IP Addresses (Medium, 42.7%)
  15. 39. Combination Sum (Medium, 62.9%)
  16. 40. Combination Sum II (Medium, 52.8%)
  17. 77. Combinations (Medium, 66.6%)
  18. 216. Combination Sum III (Medium, 64.4%)
  19. 254. Factor Combinations (Medium, 48.0%)
  20. 282. Expression Add Operators (Hard, 42.4%)
  21. 679. 24 Game (Hard, 59.2%)
  1. 704. Binary Search (Easy, 60.1%)
  2. 35. Search Insert Position (Easy, 50.0%)
  3. 33. Search in Rotated Sorted Array (Medium, 43.6%)
  4. 81. Search in Rotated Sorted Array II (Medium, 36.8%)
  5. 153. Find Minimum in Rotated Sorted Array (Medium, 48.8%)
  6. 154. Find Minimum in Rotated Sorted Array II (Hard, 43.9%)
  7. Find First and Last Position of Element in Sorted Array (Medium, 47.7%)
  8. Find Peak Element (Medium, 46.7%)
  9. 852. Peak Index in a Mountain Array (Medium, 67.1%)
  10. 540. Single Element in a Sorted Array (Medium, 59.2%)
  11. 278. First Bad Version (Easy, 46.4%)
  12. 69. Sqrt(x) (Easy, 41.0%)
  13. 50. Pow(x, n) (Medium, 37.8%)
  14. 875. Koko Eating Bananas (Medium, 49.3%)
  15. 1011. Capacity To Ship Packages Within D Days (Medium, 73.0%)
  16. 1060. Missing Element in Sorted Array (Medium, 59.5%)
  17. 1539. Kth Missing Positive Number (Easy, 62.9%)
  18. 658. Find K Closest Elements (Medium, 49.2%)
  19. 378. Kth Smallest Element in a Sorted Matrix (Medium, 64.0%)
  20. 2300. Successful Pairs of Spells and Potions (Medium, 49.2%)
  21. 4. Median of Two Sorted Arrays (Hard, 45.1%)

3. Bit Manipulation

  1. 136. Single Number (Easy, 76.8%)
  2. 137. Single Number II (Medium, 57.3%)
  3. 260. Single Number III (Medium, 68.1%)
  4. 268. Missing Number (Easy, 71.0%)
  5. 231. Power of Two (Easy, 49.5%)
  6. 190. Reverse Bits (Easy, 64.8%)
  7. 191. Number of 1 Bits (Easy, 66.8%)
  8. 338. Counting Bits (Easy, 75.7%)
  9. 201. Bitwise AND of Numbers Range (Medium, 42.4%)
  10. 371. Sum of Two Integers (Medium, 50.8%)
  11. 29. Divide Two Integers (Medium, 19.0%)
  12. 3158. Find the XOR of Numbers Which Appear Twice (Easy, 78.3%)

4. Divide & Conquer

  1. 23. Merge k Sorted Lists (Hard, 58.1%)
  2. 215. Kth Largest Element in an Array (Medium, 68.5%)
  3. 973. K Closest Points to Origin (Medium, 68.4%)
  4. 240. Search a 2D Matrix II (Medium, 56.2%)
  5. 378. Kth Smallest Element in a Sorted Matrix (Medium, 64.0%)
  6. 4. Median of Two Sorted Arrays (Hard, 45.1%)
  7. 315. Count of Smaller Numbers After Self (Hard, 42.8%)
  8. 327. Count of Range Sum (Hard, 36.8%)
  9. 493. Reverse Pairs (Hard, 28.3%)
  10. 218. The Skyline Problem (Hard, 44.5%)
  11. 312. Burst Balloons (Hard, 56.0%)
  12. 241. Different Ways to Add Parentheses (Medium, 63.7%)
  13. 95. Unique Binary Search Trees II (Medium, 50.5%)
  14. 96. Unique Binary Search Trees (Medium, 56.8%)

Day 5 Study Tips

  • Master backtracking template (choose, explore, unchoose)
  • Understand binary search edge cases
  • Practice divide and conquer patterns
  • Learn heap/priority queue for k-way merge

General Preparation Strategy

Daily Routine (4-6 hours)

  1. Morning (2-3 hours): Solve 4-5 problems
    • Read problem carefully
    • Think through approach (5-10 min)
    • Implement solution (20-30 min)
    • Test edge cases
    • Review optimal solution if stuck
  2. Afternoon (2-3 hours): Solve remaining problems
    • Focus on patterns you’re weak in
    • Time yourself (30-45 min per problem)
    • Review solutions after solving
  3. Evening (30 min): Review and consolidate
    • Summarize patterns learned
    • Note common mistakes
    • Review similar problems

Meta Interview Tips

  1. Communication First
    • Explain your approach before coding
    • Ask clarifying questions
    • Discuss time/space complexity
  2. Think Aloud
    • Meta values communication skills
    • Walk through your thought process
    • Discuss trade-offs
  3. Edge Cases
    • Always consider empty inputs
    • Handle single element cases
    • Check boundary conditions
  4. Optimization
    • Start with brute force if needed
    • Optimize step by step
    • Discuss further optimizations
  • LeetCode Premium: Access Meta tagged problems
  • NeetCode: Structured problem lists
  • Blind 75: Essential problems list
  • Meta Interview Prep: Official Meta resources

Tracking Progress

Create a spreadsheet tracking:

  • Problem name and difficulty
  • Time taken
  • First attempt success rate
  • Key patterns learned
  • Areas needing improvement

Final Day Recommendations

Mock Interview Practice

  1. Practice with Timer
    • 45 minutes per problem
    • Simulate real interview conditions
  2. Explain Solutions
    • Practice explaining to a friend
    • Record yourself explaining
  3. Review Meta-Specific Problems
    • Search “Meta” tag on LeetCode
    • Focus on recent interview questions
  4. Rest and Relax
    • Don’t cram on the day before
    • Get good sleep
    • Stay confident

Additional Meta-Specific Problems

These problems also appear frequently in Meta interviews and can be practiced as supplementary problems:

String & Array Problems

  • 71. Simplify Path (Medium, 49.2%) - Stack-based path normalization
  • 1249. Minimum Remove to Make Valid Parentheses (Medium, 71.1%) - Stack with tracking
  • 408. Valid Word Abbreviation (Easy, 37.0%) - Two pointers on strings
  • 415. Add Strings (Easy, 52.0%) - String addition with carry
  • 670. Maximum Swap (Medium, 51.9%) - Greedy array manipulation
  • 1047. Remove All Adjacent Duplicates In String (Easy, 72.3%) - Stack-based removal
  • 26. Remove Duplicates from Sorted Array (Easy, 61.5%) - Two pointers
  • 605. Can Place Flowers (Easy, 29.0%) - Greedy array traversal
  • 1207. Unique Number of Occurrences (Easy, 78.5%) - Hash map frequency counting
  • 163. Missing Ranges (Easy, 35.5%) - Array range handling
  • 169. Majority Element (Easy, 65.9%) - Boyer-Moore voting algorithm
  • 3354. Make Array Elements Equal to Zero (Easy, 68.4%) - Array operations
  • 8. String to Integer (atoi) (Medium, 20.0%) - String parsing with edge cases
  • 468. Validate IP Address (Medium, 28.0%) - String validation
  • 724. Find Pivot Index (Easy, 61.4%) - Prefix sum technique
  • 921. Minimum Add to Make Parentheses Valid (Medium, 74.5%) - Stack or counting
  • 2667. Create Hello World Function (Easy, 82.0%) - JavaScript/TypeScript basics
  • 15. 3Sum (Medium, 37.9%) - Two pointers with sorting
  • 16. 3Sum Closest (Medium, 47.5%) - Two pointers variant
  • 246. Strobogrammatic Number (Easy, 47.6%) - String validation with hash map
  • 1431. Kids With the Greatest Number of Candies (Easy, 88.1%) - Array manipulation

Tree & Graph Problems

  • 1091. Shortest Path in Binary Matrix (Medium, 50.7%) - BFS on grid
  • 129. Sum Root to Leaf Numbers (Medium, 69.2%) - DFS traversal
  • 863. All Nodes Distance K in Binary Tree (Medium, 67.1%) - Graph BFS
  • 545. Boundary of Binary Tree (Medium, 47.6%) - Tree traversal order
  • 695. Max Area of Island (Medium, 73.5%) - DFS on grid
  • 270. Closest Binary Search Tree Value (Easy, 49.4%) - BST traversal
  • 426. Convert Binary Search Tree to Sorted Doubly Linked List (Medium, 65.6%) - In-order traversal
  • 2265. Count Nodes Equal to Average of Subtree (Medium, 86.7%) - Post-order DFS
  • 133. Clone Graph (Medium, 63.8%) - DFS with hash map
  • 417. Pacific Atlantic Water Flow (Medium, 60.1%) - Multi-source BFS/DFS
  • 827. Making A Large Island (Hard, 55.8%) - DFS with union-find

Dynamic Programming & Advanced

  • 32. Longest Valid Parentheses (Hard, 37.3%) - DP or stack
  • 5. Longest Palindromic Substring (Medium, 36.7%) - DP or expand centers
  • 10. Regular Expression Matching (Hard, 29.9%) - DP state machine
  • 394. Decode String (Medium, 61.8%) - Stack-based recursion

Hash Tables & Design

  • 1570. Dot Product of Two Sparse Vectors (Medium, 89.9%) - Hash map for sparse data
  • 347. Top K Frequent Elements (Medium, 65.1%) - Hash map + heap
  • 791. Custom Sort String (Medium, 72.2%) - Hash map ordering
  • 528. Random Pick with Weight (Medium, 48.7%) - Prefix sum + binary search
  • 398. Random Pick Index (Medium, 64.8%) - Reservoir sampling
  • 1865. Finding Pairs With a Certain Sum (Medium, 61.7%) - Hash map + two sum variant

Linked Lists & Advanced

  • 708. Insert into a Sorted Circular Linked List (Medium, 38.4%) - Linked list insertion
  • 147. Insertion Sort List (Medium, 57.5%) - Linked list sorting
  • 23. Merge k Sorted Lists (Hard, 58.1%) - Divide and conquer or heap

Graph Algorithms

  • 127. Word Ladder (Hard, 44.1%) - BFS shortest path
  • 269. Alien Dictionary (Hard, 36.9%) - Topological sort
  • 721. Accounts Merge (Medium, 60.4%) - Union-find or DFS

Binary Search & Optimization

  • 34. Find First and Last Position of Element in Sorted Array (Medium, 47.7%) - Binary search variants
  • 378. Kth Smallest Element in a Sorted Matrix (Medium, 64.0%) - Binary search on matrix
  • 875. Koko Eating Bananas (Medium, 49.3%) - Binary search on answer
  • 704. Binary Search (Easy, 60.1%) - Classic binary search

Sliding Window & Array

  • 239. Sliding Window Maximum (Hard, 48.1%) - Deque or heap
  • 480. Sliding Window Median (Hard, 38.8%) - Two heaps
  • 1004. Max Consecutive Ones III (Medium, 66.8%) - Sliding window

Miscellaneous

  • 31. Next Permutation (Medium, 44.1%) - Array manipulation
  • 48. Rotate Image (Medium, 78.8%) - Matrix rotation
  • 973. K Closest Points to Origin (Medium, 68.4%) - Heap or quick select
  • 636. Exclusive Time of Functions (Medium, 65.4%) - Stack-based parsing
  • 986. Interval List Intersections (Medium, 72.8%) - Two pointers on intervals
  • 227. Basic Calculator II (Medium, 46.3%) - Stack-based evaluation
  • 339. Nested List Weight Sum (Medium, 85.8%) - DFS on nested structures
  • 1762. Buildings With an Ocean View (Medium, 80.9%) - Monotonic stack
  • 1539. Kth Missing Positive Number (Easy, 62.9%) - Binary search or linear
  • 825. Friends Of Appropriate Ages (Medium, 49.5%) - Two pointers or counting
  • 1094. Car Pooling (Medium, 56.1%) - Sweep line or prefix sum
  • 134. Gas Station (Medium, 47.1%) - Greedy algorithm
  • 498. Diagonal Traverse (Medium, 66.7%) - Matrix traversal
  • 2257. Count Unguarded Cells in the Grid (Medium, 69.2%) - Grid simulation
  • 3346. Maximum Frequency of an Element After Performing Operations I (Medium, 39.9%) - Array operations
  • 295. Find Median from Data Stream (Hard, 53.8%) - Two heaps
  • 3461. Check If Digits Are Equal in String After Operations I (Easy, 82.5%) - String manipulation
  • 1868. Product of Two Run-Length Encoded Arrays (Medium, 59.5%) - Array encoding
  • 2043. Simple Bank System (Medium, 70.2%) - Design problem

Problem Distribution Summary

Day Topic Sub-categories Problems Easy Medium Hard
1 Arrays, Strings & Two Pointers Two Pointers/Sliding Window, String Manipulation, Array Operations, Hash Tables ~141 ~40 ~90 ~11
2 Trees, Graphs & Traversal Binary Trees, BST, Graph Traversal, Grid/Matrix ~57 ~4 ~47 ~6
3 Dynamic Programming & Advanced String 1D DP, 2D DP, String DP, Math/Combinatorics ~54 ~5 ~40 ~9
4 Hash Tables, Linked Lists & Design Hash Tables/Design, Linked Lists, Heaps, Stack/Queue ~72 ~15 ~52 ~5
5 Backtracking, Binary Search & Advanced Backtracking, Binary Search, Bit Manipulation, Divide & Conquer ~73 ~8 ~55 ~10
Total All Topics 20 Sub-categories ~397 ~72 ~284 ~41

Note: Some problems appear in multiple categories (e.g., “Subsets” appears in both backtracking and array operations). Total unique problems is approximately 350+.

Success Metrics

By the end of 5 days, you should be able to:

  • ✅ Solve medium problems in 30-45 minutes
  • ✅ Explain your approach clearly
  • ✅ Identify problem patterns quickly
  • ✅ Handle edge cases systematically
  • ✅ Optimize solutions when needed

Good luck with your Meta interview preparation! 🚀