Two problems. Second one was a more complicated twist of the first one. Review data structures, especially HashTables/HashMaps, and Big-O analysis. My interviewer wanted the most efficient solution, so it's necessary to understand the complexity of your algorithm. Cracking the Coding Interview was very helpful in my preparation.
Mostly technical questions
find the depth of a B-tree.
Merge sort related question
Pow
A lot of technical and logical questions
LC Mediums and Easies, OOD Design
Tell me about a time. (x2) + follow ups
Online assessment had questions on java programming language
Online Assessment: 2 LC Medium (heap/maps related) Interview (45 mins): Behavioral 3 to 4 Qs focusing on leadership principles (15-20 minutes) 3 coding Qs LC Easy-Medium level order traversal zigzag traversal reverse linked list (30-40 minutes)
Viewing 7261 - 7270 interview questions