Asked about data structures(priority queues, sets and maps) working and implementation from scratch. The interviewer asked a little advanced data structures like segment trees, and finally asked few graph algorithms and their complexity analysis.
Anonymous
I explained the approach for implementing priority queues (heaps), sets (BSTs) and maps( hash / BSTs). Satisfied with the approach and didn't ask to code. Explained and written pseudocode for segment tree implementation fully satisfied. Casually asked few graph algorithms, answered everything.
Check out your Company Bowl for anonymous work chats.