Phone Screen:
Q1: LCA of a Binary Tree III

• Stack + O(1) space solutions

Q2: Local minimum of Find Peak Element

• O(logn) time

Onsite
Coding Round 1
Q1: Valid Number (No exponent)
Q2: BST Iterator

• Follow up -> hasNext() and next() receive int n and I have to return the nth node

System Design
Top K -> https://www.hellointerview.com/learn/system-design/problem-breakdowns/top-k

Coding Round 2
Q1: Binary Tree Vertical Order Traversal/Vertical Order Traversal of a Binary Tree

• Don't remember which one exactly, but the approach for both are basically the same

Q2: Diagonal Traverse Variant

• Print elements from top right to bottom left