Google L3 New Grad VO: Talkative Users, Calculator Variant, and Repeated-Substring Task

Role: Software Engineer, L3 New Grad
Result: Final outcome not disclosed
Report time: February 2025

The candidate completed three coding rounds. They found the questions manageable but introduced several bugs that were corrected after interviewer prompts.

Coding round 1: most talkative users

Use a heap to return the top talkative users from chat-history activity.

Practice: Top K Most Talkative Chat Users

Coding round 2: calculator variation

The second question was a calculator whose difficulty and operator set were described as somewhere between LeetCode 224 and 772.

The source does not preserve the exact operators, parentheses rules, unary behavior, or input grammar, so no calculator link is asserted as exact.

Coding round 3: repeated-substring-like problem

The final task was unfamiliar and only described as similar to a longest repeated substring problem. The source does not state the objective or required output, and a commenter asking for the approach received no answer.

No behavioral questions or later result were preserved.