Google DS & Algo Round Interview Questions
Google's interview codebase is very large, with questions of all difficulty levels from super easy to super hard. One question can be a medium question with a couple of follow-ups for optimizations, or it can be just one hard question. It all depends on which question the interviewer chooses.
There are two common things about candidates who clear Google interviews and whose overall process is smooth.
- At least 2 "Strong-Hire" votes and no "No-Hire" in the on-site packet.
- Candidates who narrated trade-offs and edge cases, and correctly answered counter questions, got bumped from "Hire" to "Strong Hire" even with small bugs.
Point 2 is also valid for other top tech companies like Microsoft, Amazon, Meta, etc.
Interviewers are given explicit instructions to treat the phone-screen interview as just a normal interview and give ratings as:
If the question's difficulty level is hard, then SH, H, LH, and LNH are considered passed.
Otherwise, SH, H, and LH are considered passed.
I created this list from people posting their experiences on forums, blogs, etc.
Below are the questions which you can directly find on LeetCode.
LeetCode Questions
- Minimum Window Substring https://leetcode.com/problems/minimum-window-substring/description/
- Meeting Rooms III https://leetcode.com/problems/meeting-rooms-iii/description
- Longest Duplicate Substring https://leetcode.com/problems/longest-duplicate-substring/description
- Decode String https://leetcode.com/problems/decode-string/description/
- Decode Ways https://leetcode.com/problems/decode-ways/description/
- Path With Minimum Effort https://leetcode.com/problems/path-with-minimum-effort/
- Course Schedule II https://leetcode.com/problems/course-schedule-ii/description/
- Sum of Distances in Tree https://leetcode.com/problems/sum-of-distances-in-tree/description/
- Course Schedule https://leetcode.com/problems/course-schedule/description
- House Robber https://leetcode.com/problems/house-robber/description/
- Special Array II https://leetcode.com/problems/special-array-ii/description
- Lowest Common Ancestor of a Binary Tree https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/
- Guess the Word https://leetcode.com/problems/guess-the-word/description/
- First Bad Version https://leetcode.com/problems/first-bad-version/description/
- Partition Equal Subset Sum https://leetcode.com/problems/partition-equal-subset-sum/description/
- Number of Visible People in a Queue https://leetcode.com/problems/number-of-visible-people-in-a-queue/description/
- Find if Path Exists in Graph https://leetcode.com/problems/find-if-path-exists-in-graph/description/
- Permutation Sequence https://leetcode.com/problems/permutation-sequence/description/
- Positions of Large Groups https://leetcode.com/problems/positions-of-large-groups/description/
- Find First and Last Position of Element in Sorted Array https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/
- Expressive Words https://leetcode.com/problems/expressive-words/description/
- Top K Frequent Elements https://leetcode.com/problems/top-k-frequent-elements/description/
- Happy Number https://leetcode.com/problems/happy-number/description/
Below list is updated frequently. Reflects top Google questions in last 6 months.
Founder, CodeZym