YOE - 2

Phone Screen:

• https://leetcode.com/problems/kth-largest-element-in-an-array/ - Completed with O(nlogk)
• https://leetcode.com/problems/validate-binary-search-tree/ - Completed with O(n) using min-max range

Onsite:

Round 1:

• https://leetcode.com/problems/valid-palindrome-ii/ - Completed with O(n)
• https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/ - Partially completed this one. I got confused writing the code. I feel this is the one going to cost me.

Round 2:

• Behavioral Questions
• https://leetcode.com/problems/simplify-path/ - Completed in O(n+m)
  It was not exactly this but very similar.
  Simplify(String location, String input)

Round 3:

• https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/ - Completed O(n) using two stack
• https://leetcode.com/problems/remove-invalid-parentheses/. - Completed with recursive approach 2^n

Round 4:

• Design something similar to Web crawler given you have 10000 bots to help you.

Overall experience was good. Interviewers were friendly. Ask them questions if you have doubts.