Round 0 - hackerrank test

• 2 questions - both were mediums, one related to matrix and other some data parsing
• They also for approach and complexity in separate explanation section so in total it has 4 questions - 2 questions and 2 for explaining the approach and complexity of solution

Round 1 - Phone screen

• 5 mins introduction
• 15 mins LP questions
  • Tell me an instance when you anticipated customers requirement
  • Time when you took calculated risk with informing your seniors
  • One more - don’t remember
• https://leetcode.com/problems/recover-binary-search-tree/

I explained O(N^2) approach to solve this problem and said I am thinking of optimized one, after couple of mins he interrupted and said at the end of the interview we want to some code to review so either you can write code for this approach itself or think for better approach. I decided if code is mandatory then better to write this one then optimize later if possible - I wrote and explained time and space complexity and didn't had time left to optimize it

Got rejection in next hour!