I had a 30-min interview where they basically verified it was me who wrote the code for 1st and 2nd rounds. Asked questions about my approach: like why I used these data structures, what the time complexity of my solution was and whether I could improve those solutions.
Given 2 sorted linked lists, merge them in sorted order. Then, given k linked lists how would you merge them in the most efficient way possible.
Parse a string that is a mathematical expression and calculate its total value
hashing reverse palindrome leetcode question
Explained everything in the interview process section.
1. Trie 2. Design 3. Parentheses And BQs
Fill the Truck - online assessment
Debugging were trivial. Interview questions was medium / hard LC.
Leetcode style problem
1. two sum 2. detect the circle in a LinkedList
Viewing 5951 - 5960 interview questions