Status: MS in CS
Position: SDE at a top tier US company for 1+ year
Location: Sunnyvale, CA
Date: Feb 2021

I was invited for direct onsite.

Round 1:

1. Find if an element exists in a Linked List.
2. Find the number of groups of consecutive number in a linked list if I am given a head. Follow up: we have a doubly linked list when I am given a random node.

Round 2:
Code the following expansions:

1. a(b,c) => ab,ac
2. a(b,c(d,e)) => ab,acd,ace
3. (a,b)(c,d) => ac,ad,bc,bd
   I was able to code for the first two examples and kind of ignored the third example in my code. We kind of discussed adding the third case in my current code. Time complexity was O(n)

Round 3: Behavioral round with manager. Discussed about work in resume

Round 4:
Given a mxn matrix of 0s. Find the number of squares of 0s which are present in the matrix. Derived the formula on the spot and solved the question within a couple of mins. Follow up: Now the matrix consists of 0s and 1s and we have to find the number of squares. Used a 2D matrix DP approach and solved it. Further optimized the space by using a 1D array DP. Recruiter was happy with the approach

Round 5:
Couple of behavioral questions. Then 1 coding question: A string consists of 2xg gold and 2xs silver. Find 2 split points in the string such that the number of gold and silver in second part is equal to gold and silver in first and third part. Used sliding window to find s+g silver and gold in O(n) time.

Recruiter reached out to me in a couple of days and told me that they are moving forward with the Hiring committee. Hiring committee approved in a day. Then I had 3 team match calls over the span of 2 weeks and was selected for 2 of them. I finalized 1 team and got VP and compensation approval same day.
Recruiter initially reached out to me in Jan and the interviews were scheduled in Feb end. Received my offer in March. Started in April.