Google: Software Engineer (University Graduate)
Google's India university-graduate hiring is mostly described by a small number of self-reported candidate accounts: recruiter contact by email, sometimes an online assessment with two problems in 90 minutes, then interview rounds that mix DSA problems with a Googliness behavioural round. There is no official public round list, and average time to hire is reported near 75 days. Treat this kit as practice material rather than a guarantee of the exact format.
27 questions · 4 rounds · updated Nov 2026
How the interview works
- Online assessment: Two problems in 90 minutes in one report; not every candidate gets one.
- Coding interviews: DSA rounds on trees, graphs, strings, dynamic programming and hard medium problems.
- Googliness: Behavioural conversation on collaboration, ambiguity and humility.
- Team match: Possible after interviews; timelines are long.
Sample questions
- 01
What is a deadlock? What are its four conditions and how do you prevent it?
MediumOperating systems
Model answer
What the interviewer checks
The four Coffman conditions and a practical prevention, such as lock ordering.
How to answer
A deadlock is when two or more processes each wait for a resource another holds, so none can continue. Example: thread 1 holds lock A and wants B; thread 2 holds B and wants A. It needs all four conditions: 1. Mutual exclusion: a resource can be held by only one process. 2. Hold and wait: a process holds one resource while waiting for another. 3. No preemption: resources can't be forcibly taken. 4. Circular wait: a cycle of processes, each waiting on the next. Break any one to prevent it. The most practical fix is to remove circular wait: always acquire locks in a fixed global order (A before B). Others: request all resources at once, use timeouts (tryLock), or avoidance with the Banker's algorithm, which grants a request only if the system stays in a safe state.
Likely follow-ups
- Deadlock vs starvation: in a deadlock nobody progresses. In starvation others progress but one process waits indefinitely, for example a low-priority job; aging fixes it.
- 02
According to the CAP theorem, during a network partition a distributed database must choose between:
MediumSystem design
- 03
Find the length of the longest substring without repeating characters. Example: "abcabcbb" → 3 ("abc"), "pwwkew" → 3
MediumSliding window
Approach and solution
Approach
Sliding window with the last index of each character. When a character repeats inside the window, move the left edge to one past its previous index. Never move left backwards, hence the max().
def longest_unique(s: str) -> int: last, left, best = {}, 0, 0 for right, c in enumerate(s): if c in last and last[c] >= left: left = last[c] + 1 last[c] = right best = max(best, right - left + 1) return best assert longest_unique("abcabcbb") == 3 assert longest_unique("pwwkew") == 3 assert longest_unique("abba") == 2Complexity: O(n) time, O(k) space for the alphabet.
Likely follow-ups
- Return the substring itself: keep the left index of the best window as well as its length.
24 more questions, members only
- Online assessment4
- Coding interviews10
- Fundamentals7
- Googliness and leadership6
Members also get how to answer each question and a preparation plan for this company.
See plans from ₹399Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.