google logo
Google· MLOps Engineer (L5)

Google L5 Reject -- Bengaluru -- Ph.D.

Location
Bengaluru
Posted
16 May 2025
348 reads

Summary

I had an interview experience at Google Bengaluru for an MLOps L5 role. The process involved a telephonic screen and four on-site rounds covering data structures, algorithms, and system design, concluding with a reject.

How it went

Hello Everyone.

I am sharing my interview experience at Google Bengaluru. Distributed learning team (Berlin HQ), MLOps role. I was contacted by a recruiter in the month of February.

Telephonic Interview

Nice and humble interviwerer. I got stuck at one point, where she pointed out an errornous assumption I was making.

Question.

Given two strings $s_1$ and $s_2$, where $len(s_1) >> len(s_2)$, find the minimal substring $s_k$ in $s_1$ such that $s_2$ can be constructed by picking letters from $s_k$ one or more times. Return the first and (last - 1) index of the string $s_k$ in $s_1$.

How I solved.

String Manipulation -> substring window
DP Approach -> 
Suffix Tries -> Largest suffix to ignore.

Verdict

Hire

Round-1 Interview

Question.

Given an array of numbers, where $i \leq a[i] \leq i^2$, find the largest subarray with sum, $s$ such that $s \neq n \bigwedge s < n^2$ where, $n$ is the size of the array.

How I solved.

Verdict

Strong Hire

Round-2 Interview

Question.

Similar to House Robber - III.

How I solved.

Verdict

Strong Hire

Round-3 Interview

Question.

LRU Cache implementation with a tweak.

How I solved.

Verdict

Lean

Round-4 Interview

Interviewer was in a hurry. Gave vague constraints. He asked my what was the motivation to do a Ph.D. in computer science?

Question.

Given a matrix of size $n \times m$, Find the largest submatrix of size $i \times j$ such that the sum over rows equals sum over columns and the total sum is less that $n + m$.

How I solved.

2D Array + DP
Direction vectors

Verdict

Reject

Questions asked (6)

  1. 01

    Minimal Substring to Construct Word

    Data Structures & Algorithms · Hard

    Given two strings $s_1$ and $s_2$, where $len(s_1) >> len(s_2)$, find the minimal substring $s_k$ in $s_1$ such that $s_2$ can be constructed by picking letters from $s_k$ one or more times. Return the first and (last - 1) index of the string $s_k$ in $s_1$.

    Open the problem
  2. 02

    Largest Subarray Sum with Specific Constraints

    Data Structures & Algorithms · Medium

    Given an array of numbers, where $i \leq a[i] \leq i^2$, find the largest subarray with sum, $s$ such that $s \neq n \bigwedge s < n^2$ where, $n$ is the size of the array.

    Open the problem
  3. 03

    House Robber III

    Data Structures & Algorithms · Medium

    Similar to House Robber - III.

    Open the problem
  4. 04

    LRU Cache Implementation with Tweak

    Data Structures & Algorithms · Medium

    LRU Cache implementation with a tweak.

    Open the problem
  5. 05

    Motivation for Ph.D. in Computer Science

    Behavioral

    He asked my what was the motivation to do a Ph.D. in computer science?

  6. 06

    Largest Submatrix with Equal Row/Column Sums and Total Sum Constraint

    Data Structures & Algorithms

    Given a matrix of size $n \times m$, Find the largest submatrix of size $i \times j$ such that the sum over rows equals sum over columns and the total sum is less that $n + m$.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!