Google Early Career R1 Rejection: Top-K Nonnegative Subset Sums and BQ

Role: Software Engineer, New Grad / Early Career
Result: Rejected after R1
Report time: January 2026

Coding: top-K subset sums

Given distinct objects with nonnegative weights, return the k subset sums in decreasing order.

The problem resembles LeetCode 2386, Find the K-Sum of an Array, with the nonnegative-weight condition simplifying part of the search.

The candidate implemented brute force but could not complete the max-heap solution. They received the rejection three days later.

Practice: Top K Subset Sums of Nonnegative Weights

Behavioral interview

The interviewer asked for complete experience stories rather than many hypothetical scenarios. Topics included:

• Handling an uncooperative coworker
• Acting when there is no clear solution and explaining the resulting impact
• An unexpected outcome at work
• Applying something newly learned to the job
• Missing a self-set goal, why it happened, and what was learned

The interviewer rephrased each answer, asked for missing STAR context or measurable impact, and took notes. The candidate recommended answering as if the interviewer had never seen the resume.