Google L3 | Phone Screening | Interview
- Result
- Ongoing
- Posted
- 25 Aug 2025
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)
- 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 theencoded_stringinside the square brackets is being repeated exactlyktimes. 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" - 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], wherekis the number of timesencoded_stringrepeats. The goal is to minimize the length of the encoded string.
Input:s = "aaabcbc"
Output:"3[a]2[bc]"