Google

1. 1

   Resume shortlist

   Resume shortlist (no test)
   eliminatory

   No coding test was held; candidates were shortlisted on resume. Entry routes: career portal with referral, or invitation after a Google coding contest. A short recruiter call (about 15 minutes) covered skills, projects, practice volume and ratings, followed by a prep session; one account says an HR call preceded each technical round.

2. 2

   Technical interview

   Technical interview 1
   Google Meet with shared document editor45 minmedium

   scheduling · greedy · 2D prefix sums · AI proficiency · RAG · agents · LLM usage

   45 to 60 minutes. Interviewer may ask for constant extra space by modifying the input. Ends with questions on how the candidate uses AI and thoughts on AI in industry.

3. 3

   Technical interview

   Technical interview 2
   Google Meet with shared document editor45 minmedium

   pattern matching · tries · hash map DP · monotonic stack · complexity analysis · LLM context window · LLM harness vs model

   Selection reportedly depends on both rounds combined. One account had round 2 a month after round 1. AI proficiency questions again at the end.

Advice from candidates

90 pieces of advice, in their own words. Names removed.

• They do not ask questions about advanced algorithms or complex concepts. Instead, they focus on the applications of various data structures and algorithms. Therefore, if you learn about arrays, stacks, queues, priority queues, min/max heaps, sets, maps/dictionaries/hash tables, DFS, BFS, Dijkstra's algorithm, and topological sort, you will be well-prepared.

  preparation · 2024-25

• Concentrate on building your problem-solving skills. Best of luck with your interviews!

  preparation · 2024-25

• Include technical projects for your technical roles in decreasing order of complexity instead of technologies used. To say more frankly, rank a project requiring more intellectual work higher than one requiring more grunt work.

  resume · 2024-25

• Include at least one project that is deployable in the future; that is, the project is more application-based and specific.

  resume · 2024-25

Loading the other 86…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

• Codingminimum Manhattan travel to bring items to start, two carried per trip
• Codingwidest distance between ends of valid local-maximum chains in an array
• Technicalsimulate a door with two queues and priority rules
• Technicalfind valid root nodes of a bounded-degree graph for a binary tree
• Technicalsame graph with alternating-layer colour constraint
• Technicaltwo-bag longest contiguous collection by colour
• Technicalcount password-like substrings with length, letter and digit minimums
• Technicalprint all numbers up to a huge power of ten
• Technicalarrange crop counts so same crops are adjacent on two joined fields
• Technicalcount pairs where value difference equals index difference, O(n) then O(1) space
• Codingbacktracking search with partial test passing
• Codingsegment tree combined with DFS
• CodingDP-focused problems; varies per candidate
• Technicaldesign a ticket booking application
• Technicalcount words satisfying length and digit-letter rules in a sentence
• Technicalenumerate all n-digit strings with minimal extra space
• Technicaltwo-player pick one or two items to maximise score
• Technicalflood fill from 1D to 2D
• Technicalshortest path with blocked cities, then blocked cities with unit cost
• Technicalallocate smallest free numbered server names with push and pop
• Technicalimplement big-integer operations manually
• Technicalstory-style multi-source BFS assigning power levels
• Technicalk most similar items with highest ratings via graph BFS and heap
• Technicalelimination tournament winner, deterministic then probabilistic