Google·Software Engineer·Onsite - Coding / Algorithms
Jun 2026
Google onsite coding round, AI/ML loop. One problem, the whole session, and it looked deceptively simple until I had to actually justify why two cuts are always enough.
- Given a circular string of 'D' and 'R' characters with equal counts of each, find at most 2 cut positions that split the necklace into two pieces where each piece has the same number of D's and R's. You also need to justify why 2 cuts always suffice.
“The part that tripped me up wasn't the sliding window, it was the verbal justification.” The rest of the author's notes on Software Engineer interview at Google, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post