16 Google interview problems, solved step by step.
Google’s coding rounds lean on graphs and dynamic programming more than most. These are the classic problems that practise that mix, from grid searches and course prerequisites to string DP. No company publishes its questions; this is the practice set candidates commonly use. Each one is solved in 22 languages from brute force to optimal, with code you can run on the page.
0/16 solved
- Two SumEasy
- Valid AnagramEasy
- Longest Substring Without Repeating CharactersMedium
- Product of Array Except SelfMedium
- Container With Most WaterMedium
- Merge IntervalsMedium
- Search in Rotated Sorted ArrayMedium
- Number of IslandsMedium
- Course ScheduleMedium
- Binary Tree Level Order TraversalMedium
- Top K Frequent ElementsMedium
- Kth Largest Element in an ArrayMedium
- Coin ChangeMedium
- Word BreakMedium
- Edit DistanceHard
- Trapping Rain WaterHard