Status : New Grad
Date : March 26th, 2020

Interview dates:

• Feb 2nd week - Online round
• March 2nd week - Virtual onsite rounds 1
• March 3rd week - Virtual onsite round 2
• March 4th week - Virtual onsite round 3 & 4

Interview Process

1. Online Assesment :
   • MCQ's on C++ (Output Based),
   • 2 Programming Questions (Slightly Modified)
     • https://leetcode.com/problems/edit-distance/
     • https://leetcode.com/problems/unique-email-addresses/
2. Onsite Rounds:
   • Round 1: Introduction & Two Problems
     • Matrix contains 0s and 1s. The matrix is sorted row-wise. Find the row with maximum 1s. Time Complexity : O(n)
     • Find all the anagrams in a list
   • Round 2 : Introduction & Two Problems
     • Replace every node in a binary tree with the sum its inorder predecessor and successor
     • Minimum Platforms for trains required given the arrival and departure Time
   • Round 3: Introduction & Two Problems
     • Kth Largest element in an infinite sequence of numbers.
     • https://leetcode.com/problems/find-peak-element/
   • Round 4: LP Questions on projects & Two Problems
     • Find nodes at distance k from a node in a binary tree. (Given Root)
     • Clockwise Spiral Traversal of a binary Tree

LP QUESTIONS
1. What was the most challenging project.
2. When were you able to come up with a creative solution to a complex problem.

Tips:
1. I've always been asked to find the most efficient solution.
2. They will look closely on the code & the complexity.