**November end**: I applied through a gform posted by the recruiter and various telegram groups, no referral.\n**December 1st week**: Got a mail with the OA link, not everyone submitting the form got the mail so yeah some sort of resume/random shortlisting .\n\n-----------------------------------------------------------------------------------------------\n**Online Assesment: 3qs in 105 mins**\nQ1:(Basic) sliding window maximum, solved using deque\nQ2:(Medium) Question on Graphs, solved using topological sort, (similar to course schedule2 at leetcode)\nQ3:(Good) DP problem on grid with blocked cells (unseen problem for me)\n\nWas able to solve first two in 30 mins, last one took 1 hour to get the logic\nsolved all three with 8 mins remaining\n\n-------------------------------------------------------------------------------------------------\nAfter 2 days got a mail with the interview schedule, afaik only those who were able to solve all only got the interview opportunity\n\n**3 rounds of interview, consecutive days, all eliminatory\nR1: DS/Algo round\nR2: CS fundamentals\nR3: Fitment**\n\n\n-------------------------------------------------------------------------------------\n**Interview Round 1: 2 DSA qs in 60 mins with Principal Engg**\nLogic + Code + Space & Time compl + cross questions for both \n\nQ1: (Basic) Find squareroot of a number, solved using binary search\nLots of cross questions on BS: how to decide l&r values, when left<=right when left<right, when to use ans variable, etc.\n\nQ2: (Good) https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/\nA unseen problem for me, but a easy one if you\'ve solved earlier\nStruggled to get the logic fr 15-20 mins, was able to figure out after one hint from the interviewer, coded it up \n\n---------------------------------------------------------------------------------------\n\n**Interview Round 2: Verbal CS qs + SQL queries + OOP pseudo code + LRU cache (using DLL) in 60 mins with SDE3**\nFriendly discussion on DBMS( ACID, Normalization, SQL Joins), OS(deadlock, LRU, Disk scheduling, Paging), OOP (overloading, overriding, inheritance), No qs from Networks and DSA\nwas able to answer all of them with confidence\n\n---------------------------------------------------------------------------------------\n\n**Interview Round 3: More of a HM round (30 mins) with Manager**\nlots of behavioral qs, high level discussion on projects and prev internship, about zeta and internship plans\n\n--------------------------------------------------------------------------------------\nVerdict: Selected

November end: I applied through a gform posted by the recruiter and various telegram groups, no referral.\nDecember 1st week: Got a mail with the OA link, not e