google logo
Google· SDE I

Google L3 | Phone Screening | Interview

Result
Ongoing
Posted
25 Aug 2025
422 reads

Summary

I recently had a phone screening interview for an L3 role at Google, where I was presented with two challenging string manipulation problems, both of which I successfully solved.

How it went

I recently underwent a phone screening interview for an L3 position at Google. The interview focused heavily on my problem-solving skills, and I was given two distinct coding challenges related to string encoding and decoding. I managed to solve both problems during the interview session, feeling confident in my approaches.

Questions asked (2)

  1. 01

    Encode String with Brackets

    Data Structures & Algorithms · Medium

    Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.
    Input: s = "3[a]2[bc]"
    Output: "aaabcbc"

  2. 02

    Decode String to Shortest Encoded Form

    Data Structures & Algorithms · Hard

    Given a decoded string, find the shortest possible encoded string. The encoding rule is: k[encoded_string], where k is the number of times encoded_string repeats. The goal is to minimize the length of the encoded string.
    Input: s = "aaabcbc"
    Output: "3[a]2[bc]"

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!