Google Apprenticeship SAD || GOC + Phone round

google logo
google
Apprenticeship SADRejected
November 26, 2025106 reads

Summary

I interviewed for a Google Apprenticeship SAD role, which included an Online Challenge with two DSA questions and a phone call. Despite solving the coding problems effectively, I was ultimately deemed ineligible for the role due to my current student status, as it's intended for degree holders seeking a career shift.

Full Experience

I participated in the Google Apprenticeship SAD interview process, which commenced with a Google Online Challenge (GOC). During the GOC, I faced two data structures and algorithms questions. The first was an easy-level LeetCode problem, though with tricky framing: I had to pair lengths and breadths from two given arrays to form rectangles, with the goal of maximizing (or minimizing, I don't recall exactly) the total sum of the squares of the diameters of all the circumcircles around these rectangles. The second question was a medium-level dynamic programming problem: given a binary array, I needed to count the number of subarrays of a specified length 'x' that contained contiguous 1's. I successfully solved both questions within 25-30 minutes.

Following the GOC, I received a phone call from a Google recruiter. Although I initially couldn't chat as I was out, I later scheduled a formal meeting. Interestingly, the person who contacted me initially was different from my eventual interviewer. During the phone interview, I was first asked to introduce myself. Subsequently, I was informed that I was not eligible for the role because it's designed for individuals who already hold a degree and are looking for a career shift, rather than for those currently pursuing undergraduate studies or still in college. The interviewers were very polite and clearly explained the eligibility criteria for the role. Overall, it was an interesting experience.

Interview Questions (3)

Q1
Maximize/Minimize Sum of Squared Circumcircle Diameters
Data Structures & AlgorithmsEasy

You are given two arrays, one containing the lengths and the other breadths. You have to pair up one length with one breadth to form a rectangle. You need to make the pairs such that the total sum of the square of the diameter of all the circumcircles formed around the rectangle is maximized (or minimized, I don't remember).

Q2
Count Subarrays with Contiguous Ones of Length X
Data Structures & AlgorithmsMedium

There is a binary array, and you are supposed to count the number of subarrays of length 'x' with contiguous 1's, where 'x' is queried.

Q3
Self-Introduction
Behavioral

I was asked to introduce myself.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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