Officially confirmed
What Google says about its process
- 1Google evaluates each application against the qualifications and responsibilities of the specific role, so the exact interview sequence and technical emphasis vary by team and level.
- 2Official interview guidance encourages candidates to understand the role, prepare concrete examples, and treat technical conversations as collaborative problem solving.
- 3Software engineering roles commonly require data structures, algorithms, software development, testing, and—at more experienced levels—design and architecture skills.
- 4Candidates should make assumptions explicit, communicate their reasoning, test their work, and use the preparation instructions supplied by the recruiting team as the source of truth.
Official sources
Last verified 2026-08-03. We update the page when official hiring information materially changes.
Role coverage
Roles this guide supports
Practice focus
Signals to rehearse
- Data structures and algorithms
- Large-scale system design
- Testing and correctness
- Distributed systems
- Clear technical communication
Independent company-style practice
AI engineering scenarios relevant to Google
These EngMock exercises are either original, based on public engineering themes, or adapted from candidate reports, which may be about other companies. They are not represented as official or leaked Google interview questions.
Design Google Maps
Design a mapping service with route planning and ETA calculation.
View scenario →Design Typeahead
Design the search-box typeahead for a large web search engine: popular completions for every prefix, shared by all users in a locale.
View scenario →Design a Web Crawler
Design a scalable web crawler like Googlebot to index the internet.
View scenario →Design Google Docs
Design a real-time collaborative document editor supporting multiple simultaneous users.
View scenario →Determine a Valid Course Completion Order
Given a number of courses and a list of prerequisite pairs, determine a valid order to complete all courses, or report that no valid order exists.
View scenario →Cheapest Route Within a Stop Limit
Given one-way routes between cities each with a cost, find the cheapest total cost from a source city to a destination city using at most k intermediate stops.
View scenario →Count Contiguous Runs Summing to a Target
Given a sequence of integers (possibly negative) and a target sum, count how many contiguous subarrays sum exactly to the target.
View scenario →Fewest Moves to Solve a Sliding Tile Puzzle
Given a small 2-by-3 sliding tile puzzle board with one blank space, find the minimum number of adjacent tile slides needed to reach a specified target arrangement, or report it is unreachable.
View scenario →Longest Strictly Increasing Subsequence
Given a sequence of integers, find the length of the longest subsequence (not necessarily contiguous) whose elements are strictly increasing.
View scenario →Maximum Value in Every Sliding Window
Given an array and a window size k, return the maximum value within every contiguous window of size k as it slides from left to right across the array.
View scenario →Merge Overlapping Room Bookings
Given a list of room booking intervals, each with a start and end time, merge all overlapping or touching intervals into the minimal set of consolidated bookings.
View scenario →Minimum Coins to Reach an Amount
Given a set of coin denominations and a target amount, find the minimum number of coins (with unlimited supply of each denomination) needed to make exactly that amount, or report it is impossible.
View scenario →Partition a Set into Two Equal-Sum Groups
Given a set of positive integers, determine whether it can be partitioned into two groups with equal sums.
View scenario →Prefix Lookup Service for a Word Dictionary
Given a dictionary of words, build a structure that can efficiently count how many dictionary words start with a given prefix.
View scenario →Search in a Rotated Sorted Array
Given an array of distinct integers that was originally sorted ascending and then rotated at an unknown pivot, determine the index of a target value or report that it is absent.
View scenario →Track Connectivity Across a Growing Network
Given a number of servers and a sequence of direct connection events between pairs of servers, answer whether two given servers are connected after each event, handling many connections and queries efficiently.
View scenario →Track the Median of a Growing Stream
Design a structure that supports inserting numbers one at a time from a stream and efficiently reporting the median of all numbers seen so far.
View scenario →Practice the underlying interview skills
Combine a live technical mock with the candidate-reported Question Bank, then use the evidence-based report to choose your next focused scenario.