Google New Grad R1: Right-Side View, K Smallest Pair Sums, and BQ

Role: Software Engineer, New Grad
Result: Passed R1
Report time: November 2025
Application: Applied online

Coding 1: binary-tree right-side view

Given a binary tree, return the nodes visible from the right side.

The candidate used BFS, processed one level at a time, recorded the final node from each level, and then added the next level to the queue.

Practice: Binary Tree Right Side View

Coding 2: K smallest pair sums

Given arrays arr1 and arr2 and an integer k, return the smallest k values of arr1[i] + arr2[j].

The candidate inserted every arr1[i] + arr2[0] into a min-heap. After removing (i, j), they inserted (i, j + 1) and continued until they had produced k results.

Practice: K Smallest Pair Sums

Behavioral interview

Questions included:

• Why Google?
• The candidate's most exciting project
• A time they faced a tight deadline
• Their college experience

The candidate said the interviewer's hints were helpful.