- Published on
Google | Interview Experience | L4 (Rejected)
- Author
- Shared Anonymously
Year of Experience : 6 years
Current Company : Startup
College : Tier-2
Phone Screening :- https://leetcode.com/discuss/interview-question/3327144/Google-or-Phone-Screen-or-Senior-Software-Developer-or-Mountain-View-or-March-2023 (dij sol)
Onsite Round 1 :- https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/description/
Came up with almost correct solution, coded well , Positive
Onsite Round 2 :-
Given an incoming list of list of words. For an input word, You should return a word which has most frequency, which is next to it. write a set and get method.
Example :- { {a, she, he, am},
{a,he,she,you,are},
{a,he,she,he,are}},
For input a, return he (2 freq), for she return he(2 freq), for am , return empty string
Was asked to write get in O(1), which i did by pre-processing in set method and completed the code in 37 mins.
Review was not postive, was told that i was coding slow . Interview was expecting one more question,but she didn't asked with 8 mins remaining.
Onsite Round 3 :- Given a chess tournament with N players and M matches. The match results are available. Return the list of players, whose ranks can be determined definetly.
p1 vs p2 -> p1 won
p2 vs p5 -> p2 won
p2 vs p3 -> p3 won
p2 vs p4 -> p4 won
p3 vs p4-> p4 won
Here rank of p2( second last) and p5( last ) are definite.
Feedback was not positive as few test cases in the code were missing
Onsite Round 4 : Googliness Round
Don't remember the questions as interview ended more than 3 weeks ago , but general questions asked in googliness. Go for STAR method. Do few mocks
Feedback was positive