79 problems · 19 Easy, 42 Medium, 18 Hard · Ranked #31 of 458
Difficulty breakdown
19 Easy
24% · avg 23%
42 Medium
53% · avg 59%
18 Hard
23% · avg 18%
Top topics
array
44.3%
string
26.6%
dynamic-programming
16.5%
hash-table
16.5%
tree
13.9%2.5x
depth-first-search
13.9%1.5x
Interview profile
Based on 79 reported problems, Google interviews are slightly harder than average - 23% Hard vs 18% across all companies. The majority (53%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Google puts unusual emphasis on binary-indexed-tree (2.5% of problems, 5.7x the industry average), segment-tree (2.5% of problems, 4.2x the industry average), database (3.8% of problems, 3.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (44.3%), string (26.6%), dynamic-programming (16.5%), hash-table (16.5%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 79 problems
Problem
Difficulty
Frequency
Topics
Two Sum
Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing...
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two midd...
Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie...
You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and interv...
Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <=...
Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and...
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and heights of...
According to Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway...
Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked li...
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing...
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two midd...
Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie...
You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and interv...
Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <=...
Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and...
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and heights of...
According to Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway...
Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked li...
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).
MediumRare
treebreadth-first-searchbinary-tree
How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Google interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Preparing for your Google coding interview
Google interviews focus heavily on array, string, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Google interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
What coding problems does Google ask in interviews?add
Google has been reported to ask 79 distinct coding problems. The most common topics are array, string, dynamic-programming. 19 are Easy difficulty, 42 are Medium, and 18 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Google coding interviews?add
Based on 79 reported problems, Google interviews are slightly harder than average - 23% Hard vs 18% across all companies. 53% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Google coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Google coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.