Google | Interview Experience | L3 | June 2024

Status: B.Tech from tier3
Experience: 8 Years+
Position: Senior Software Engineer At a retail org
Location: Bangalore, India
Date: June 20, 2024

Round 1: 45 min

Medium-Hard question

Given a key with n digits (each ranging from 0 to 9) and a value k, denoting the number of rotations you can perform to locate the alternate key, you have two options. Determine how many keys fall inside the allowed range of k.  
  
For instance, the lock string is123, the range is0–9, and k = 2.  
  
Valid keys are 923 023 123 223...

Verdict: Hire

Round 2: 45 min

You have provided a list of experts with tags and a set of queries and tags related to them.  
Q1: Mathematics and Physics  
Q2: Structures of Data, Calculus  
Q3: Database Management System, Algebra  
Q4: Interactions  
  
E1: Database Management System and Mathematics  
E2: Physics, Calculus   
E3: Algebra, Data Structures  
E4: Algebra  
  
Assign the appropriate expert to handle each question.  
Q1 -> E1   
Q2 -> E3   
Q3 -> E4   
Q4 -> ?

Verdict: Hire

Round 3: 45 min(Extended a bit because of corner cases)

Simplify the expression  
  
(a+b) -> a + b  
(A -(b-c)) -> a-b+c

Fumbled a bit when negitive sign is there

Verdict: No Hire

Round 4: (45 min extended by 5 min to write fully working code)

Given a set of points, find the rectangle(Axis aligned) having the largest area.  
  
For instance:  
  
[1,2], [-1,2][3,4][4,5][4-5][-3,4][2,3][2,-3]  
  
https://leetcode.com/problems/minimum-area-rectangle/description/

Although i provided the solution with TC O(N^2)

Still got rejected

Round 5:

Googleeness

Verdict: Hire

Final Verdict: Reject
Cooling Period: 1 Year