Array LeetCode Questions Asked in Google Interviews
Array-based problems are one of the most commonly asked topics in Google software engineering interviews. Many complex problems are built on top of arrays and often require combining multiple techniques to solve efficiently.
Interview questions typically test your ability to apply concepts like prefix sums, sliding window, two pointers, and hashing on arrays.
In this guide, we have compiled some of the most frequently asked Array problems reported in Google interviews. Each question includes its difficulty level, interview frequency, and a direct link to the LeetCode problem so that you can start practicing immediately.
Below is a curated list of Array LeetCode questions asked in Google interviews.
| Sl.No | Question | Difficulty | Frequency | LeetCode Link |
|---|
| 1 | Two Sum | EASY | 100.00% | Solve |
| 2 | Online Election | MEDIUM | 94.50% | Solve |
| 3 | Trapping Rain Water | HARD | 85.90% | Solve |
| 4 | Merge Sorted Array | EASY | 81.40% | Solve |
| 5 | Group Anagrams | MEDIUM | 78.90% | Solve |
| 6 | Minimum Replacements to Sort the Array | HARD | 77.50% | Solve |
| 7 | 3Sum | MEDIUM | 76.70% | Solve |
| 8 | Merge Intervals | MEDIUM | 75.80% | Solve |
| 9 | Median of Two Sorted Arrays | HARD | 75.30% | Solve |
| 10 | Container With Most Water | MEDIUM | 75.10% | Solve |
| 11 | Best Time to Buy and Sell Stock | EASY | 73.40% | Solve |
| 12 | Minimum Adjacent Swaps for K Consecutive Ones | HARD | 72.60% | Solve |
| 13 | Maximum Subarray | MEDIUM | 71.10% | Solve |
| 14 | Jump Game | MEDIUM | 69.80% | Solve |
| 15 | Spiral Matrix | MEDIUM | 67.20% | Solve |
| 16 | Search in Rotated Sorted Array | MEDIUM | 67.10% | Solve |
| 17 | Longest Consecutive Sequence | MEDIUM | 66.20% | Solve |
| 18 | Maximum Difference Between Increasing Elements | EASY | 65.10% | Solve |
| 19 | Rotate Image | MEDIUM | 63.90% | Solve |
| 20 | Word Search | MEDIUM | 63.60% | Solve |
| 21 | Next Permutation | MEDIUM | 63.20% | Solve |
| 22 | Minimum Cost to Make Array Equal | HARD | 63.20% | Solve |
| 23 | Find the Largest Area of Square Inside Two Rectangles | MEDIUM | 63.20% | Solve |
| 24 | Remove Duplicates from Sorted Array | EASY | 62.90% | Solve |
| 25 | Minimum Number of Increments on Subarrays to Form a Target Array | HARD | 62.50% | Solve |
| 26 | Largest Rectangle in Histogram | HARD | 61.50% | Solve |
| 27 | Valid Sudoku | MEDIUM | 61.10% | Solve |
| 28 | Find First and Last Position of Element in Sorted Array | MEDIUM | 61.10% | Solve |
| 29 | Word Break | MEDIUM | 60.60% | Solve |
| 30 | First Missing Positive | HARD | 59.10% | Solve |
| 31 | Jump Game II | MEDIUM | 59.10% | Solve |
| 32 | Subsets | MEDIUM | 58.90% | Solve |
| 33 | Set Matrix Zeroes | MEDIUM | 58.70% | Solve |
| 34 | Find the Smallest Divisor Given a Threshold | MEDIUM | 58.00% | Solve |
| 35 | 4Sum | MEDIUM | 57.60% | Solve |
| 36 | Sort Colors | MEDIUM | 56.40% | Solve |
| 37 | Search a 2D Matrix | MEDIUM | 56.10% | Solve |
| 38 | Single Number | EASY | 55.40% | Solve |
| 39 | Pascal's Triangle | EASY | 55.40% | Solve |
| 40 | N-Queens | HARD | 53.70% | Solve |
| 41 | Word Break II | HARD | 53.30% | Solve |
| 42 | Remove Element | EASY | 52.80% | Solve |
| 43 | Combination Sum | MEDIUM | 52.80% | Solve |
| 44 | Cut Off Trees for Golf Event | HARD | 51.60% | Solve |
| 45 | Rank Teams by Votes | MEDIUM | 51.60% | Solve |
| 46 | Plus One | EASY | 51.20% | Solve |
| 47 | Permutations | MEDIUM | 50.20% | Solve |
| 48 | The Earliest Moment When Everyone Become Friends | MEDIUM | 50.00% | Solve |
| 49 | Detect Squares | MEDIUM | 50.00% | Solve |
| 50 | Odd Even Jump | HARD | 50.00% | Solve |
You can also track your progress and practice these questions using our tool:
Google LeetCode Interview Questions Tracker
How to Prepare for Array Questions in Google Interviews
To perform well in Google coding interviews, it’s important to build strong fundamentals in array-based problem solving.
Some useful preparation strategies include:
- Practicing prefix sum and cumulative array problems
- Learning sliding window and two pointer techniques
- Solving problems involving subarrays and partitions
- Combining arrays with hash tables for optimization
- Understanding time and space complexity trade-offs
Mastering arrays will help you tackle a wide range of problems efficiently in technical interviews.
Related Articles