Location : USA
Phone Screening
https://leetcode.com/problems/copy-list-with-random-pointer/
https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/ ( slight variation to make it easy)

Virtual onsite
First round

1. Convert ascii array to number. Handle edge cases
2. Find kth largest element in a matrix. Matrix is sorted row wise and column wise

Second round
Behavioral round

Third round
SD - Design facebook messenger

Fourth round

1. Find any path in a mazefrom [0,0] to [n-1,n-1]
2. https://leetcode.com/problems/basic-calculator-ii/ (only '+', '*' and number)

Result
Recruiter updated that they will not be proceeding with recruitment process as all positions are filled.