Google Coding Interview Preparation Plan
Preparation Schedule:
Day 1-7: Practice one topic each day (e.g., arrays, strings, trees).
Day 8-10: Focus on graph and dynamic programming problems.
Day 11-13: Solve mock interview-style questions.
Day 14-16: Revise and work on weaker areas.
Day 17: Relax with light review and focus on confidence.
Arrays and Strings
- Two Sum (Easy)
- 3Sum (Medium)
- Container With Most Water (Medium)
- Longest Substring Without Repeating Characters (Medium)
- Product of Array Except Self (Medium)
- Maximum Subarray (Medium)
- Median of Two Sorted Arrays (Hard)
- Sliding Window Maximum (Hard)
Linked Lists
- Reverse Linked List (Easy)
- Merge Two Sorted Lists (Easy)
- Linked List Cycle (Easy)
- Remove Nth Node From End of List (Medium)
- Reorder List (Medium)
- Copy List with Random Pointer (Medium)
- Merge k Sorted Lists (Hard)
Trees
- Binary Tree Inorder Traversal (Easy)
- Maximum Depth of Binary Tree (Easy)
- Validate Binary Search Tree (Medium)
- Binary Tree Level Order Traversal (Medium)
- Serialize and Deserialize Binary Tree (Hard)
- Lowest Common Ancestor of a Binary Tree (Medium)
Graphs
- Number of Islands (Medium)
- Clone Graph (Medium)
- Course Schedule (Medium)
- Word Ladder (Hard)
- Minimum Spanning Tree - Prim's/Kruskal's Algorithm (Custom practice needed)
Dynamic Programming
- Climbing Stairs (Easy)
- House Robber (Medium)
- Coin Change (Medium)
- Longest Increasing Subsequence (Medium)
- Word Break (Medium)
- Unique Paths (Medium)
- Edit Distance (Hard)
Sorting and Searching
- Binary Search (Easy)
- Find Minimum in Rotated Sorted Array (Medium)
- Search in Rotated Sorted Array (Medium)
- Median of Two Sorted Arrays (Hard)
Greedy Algorithms
- Meeting Rooms II (Medium)
- Jump Game (Medium)
- Minimum Number of Arrows to Burst Balloons (Medium)
Miscellaneous
- LRU Cache (Medium)
- Implement Trie (Prefix Tree) (Medium)
- Design Add and Search Words Data Structure (Medium)
