google logo
Google· l4 swe iii

Google - L4 SWE III - phone screen - Zurich

Result
no offer
Location
zurich
Posted
18 Aug 2025
472 reads

Summary

I had a phone screen with Google for the L4 SWE III role in Zurich. The interview focused on a merge interval problem, similar to LeetCode #56, but with a unique twist. Despite my best efforts, I performed poorly. However, I wanted to share the question type to help others prepare.

How it went

Today I had a phone screen with Google for the L4 SWE III role in Zurich. The interview was a single coding problem, which was similar to LeetCode #56, the merge intervals problem. However, there was a unique twist to the problem that made it more challenging. I rephrased the problem using GPT to avoid any conflict with Google's NDA. I performed very badly during the interview, but I wanted to share the question type so that others can use it for preparation.

Questions asked (1)

  1. 01

    Gaps on a Half-Line

    Data Structures & Algorithms

    Input: N, then N lines of c r.
    Each pair blocks the closed interval [c-r, c-r] on [0, ∞).
    Output: all maximal uncovered gaps in increasing order as a b; use -1 for +∞.
    Notes: intervals are closed (touching ⇒ no gap); blocks may start < 0; include the gap from 0 if any.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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