Yoe: 5.5 years
Position: SDE2
Location: Chennai, India.
Date: Jan 2021

Round 1: Online Assessment (1hour)

1. https://www.g*f*g.org/maximum-gcd-of-all-subarrays-of-length-at-least-2/
2. can't remember

Round 2: Virtual Onsite(1hour)

1. In an array there are numbers from 1 to 100.
   Array size is 101, only one number occurs twice. How to find that number in one pass - effective space and time util ?
   https://leetcode.com/problems/find-the-duplicate-number/

2. There is a n step process. Step 1 - 2 - 3 - 4 - 5
   It is sequential, if one step fails then rest of it fails
   Failure can be random. How to effectively find out which step failed ?
   https://leetcode.com/problems/first-bad-version/

3. 1 - 2 - 3 - 4 - 5
   Delete node 3 - reference of node 3 is given, not the header node.
   https://leetcode.com/problems/delete-node-in-a-linked-list/

This round went really well. Coded all the problems without error.

Round 3: Virtual Onsite(1hour)

1. Delete every nth position in a circular fashion
   similar to
   • https://www.g*f*g.org/delete-every-kth-node-from-circular-linked-list/
   • https://www.g*f*g.org/find-last-element-deleting-every-second-element-array-n-integers/
2. https://leetcode.com/problems/next-greater-element-i/ (O(n) , without extra space)
   Asked for O(n) time. Came up with Stack based solution with O(n) space.
   Follow up to without extra space. Could not come up with solution.
   -How do you scale a database?
   -How do you handle backward compatablity?