0
G

Google

Just started

The bar: Clean optimal solution, correct complexity analysis, and you drive the edge cases without prompting.

Hiring committee reviews packets, so consistency across all rounds matters more than one brilliant round.

6
ready

Early days. Work the Google sheet in order and let the planner pace you.

The loop
  1. 1
    Phone screen

    45 minutes, one medium problem in a shared doc, no autocomplete.

  2. 2
    Onsite 1-2

    Two algorithm rounds. Expect an open-ended problem plus follow-ups that change the constraints.

  3. 3
    Onsite 3

    Another algorithm round, often graph or DP flavoured, with heavy complexity discussion.

  4. 4
    Googlyness & leadership

    Behavioural round on collaboration and ambiguity.

What actually matters here
  • Think out loud from the first minute. Silence reads as being stuck.
  • State a brute force, give its complexity, then improve it. Never jump straight to the optimal solution without naming the naive one.
  • Follow-ups are the real interview. Expect what if the input does not fit in memory, or what if it streams.
  • Write compilable code. Interviewers do check for syntax that would not run.
  • Graph modelling is the single highest leverage skill here.
Difficulty mix they ask
10% easy55% medium35% hard
your easy coverage0%
your medium coverage0%
your hard coverage0%

Google sheet

Ordered by how much this company cares about the topic, then by how often the problem appears.

0 / 50 solved
The core set for this company.
349 reported by candidates
0 / 50 solved
1
2
3
4
5
6
EDynamic Programming
7
MDynamic Programming
8
MDynamic Programming
9
MDynamic Programming
10
MDynamic Programming
11
MDynamic Programming
12
MDynamic Programming
13
MDynamic Programming
14
MDynamic Programming
15
MDynamic Programming
16
17
18
19
20
21
22
23
24
25
26
27
28
HGraphs
29
30
31
32
33
34
MDynamic Programming
35
MDynamic Programming
36
MDynamic Programming
37
HDynamic Programming
38
MRecursion & Backtracking
39
MRecursion & Backtracking
40
MRecursion & Backtracking
41
MRecursion & Backtracking
42
MRecursion & Backtracking
44
45
46
47
48
49
50