Status: 3.5+ YOE
Position: SDE2 at Expedia Group
Location: Gurugram, Haryana

Round1-PS/DS

1. Find last node of a complete BST: Gave multiple approaches, approach1: traverse the tree in level order and on the last level print the last node(time complexity: O(n))
   Approach2: at each node go to that side of tree where height of tree is maximum. (time complexity: O(log(n)^2))
2. Given 2d matrix 0-can't go, non-zero - amount of gold to collect, find maximum gold we can collect.
   https://leetcode.com/problems/path-with-maximum-gold/ - discussed the approach to do this

Round 2: Machine Coding
Design StackOverflow

This was my first machine coding round. I presented the various api that will be used in the system with DAL layer, abstraction and inheritance properly been used. The interviewer was more interested in looking out for usage of design patterns, annoations etc, which I had skipped to keep things simple.

Rejection mail received.