Google New Grad R1 Rejection: Interrupted Coding Round and Perfect-Tree Indexing

Role: Software Engineer, New Grad
Result: Rejected after R1
Report time: December 2025

Coding round experience

The candidate described the interview as unusually frustrating. On the first problem, they believed their code was correct but were repeatedly asked to rewrite it until it matched the interviewer's preferred style. Frequent interruptions consumed most of the session and left little time for the second problem.

The source does not preserve the first prompt, so it cannot be reconstructed or linked.

Second problem

The second question required number-theory reasoning and used binary representation to find an index in a perfect binary tree.

The candidate had not seen that problem family before and did not have enough time to solve it. The source does not state the input, the traversal or indexing order, or the required output, so no exact practice link is asserted.

The candidate later reviewed the first implementation with an AI tool and concluded it was correct but stylistically messy. That post-interview review is the candidate's opinion, not an independent evaluation of the interviewer's grading.