Google L3 Reject
- Posted
- 22 May 2025
Summary
I completed a phone screen and four onsite rounds for a Google L3 position, but was ultimately rejected despite feeling the questions weren't hard.
How it went
TPS - Folder and file structures, where a folder can have a folder or file or both and a file will have a size, question was to find out the all the file sizes
After a week - positive feedback After 2-3 weeks 4 onsite rounds were scheduled continuosly, had multiple reschedules.
onsite 1 - An undirected graph with ring, question was to visit all the nodes in the graph, followup to check the validity of the ring.
onsite 2 - Two strings a and b, to form string a, what is the minimal number of subsequence from b.
onsite 3 - Similar to the TPS question structure, but find the top k file sizes.
Googliness - Went okayish, but got over within 30 minutes
All interviews were in the night time, hence not indian interviwers.
In the 3rd week after onsites, recruiter mentioned that they are not proceeding. Feedback was some areas to improve and some strong areas, which I felt as the standard respone template. Honestly there was no bad rounds as such, because the questions I got was not hard. Feeling bad after rejection, but there is always next time 🙂.
Questions asked (5)
- 01
File System: Sum All File Sizes
Data Structures & Algorithms
Folder and file structures, where a folder can have a folder or file or both and a file will have a size, question was to find out the all the file sizes
- 02
Graph Traversal with Ring Detection
Data Structures & Algorithms
An undirected graph with ring, question was to visit all the nodes in the graph, followup to check the validity of the ring.
- 03
Minimum Number of Subsequences
Data Structures & Algorithms
Two strings a and b, to form string a, what is the minimal number of subsequence from b.
- 04
File System: Top K File Sizes
Data Structures & Algorithms
Similar to the TPS question structure, but find the top k file sizes.
- 05
Googliness Interview
Behavioral
Went okayish, but got over within 30 minutes