in technical round 3 dsa questions first binary search ( given 2 same sorted arrays find missing element in the second array), second was to mirror a binary treee, third was to write algorithm for mst given edges.
Check out your Company Bowl for anonymous work chats.