First Round Question: You are given two linked lists and two integers i and j (i <= j). You need to replace the nodes from index i to j (0-based) in the first linked list with the entire second linked list and return the updated list. Example: Input: List1: 1 -> 2 -> 3 -> 4 -> 9 -> 6 List2: 4 -> 5 -> 10 -> 7 -> 3 i = 2, j = 4 Output: 1 -> 2 -> 4 -> 5 -> 10 -> 7 -> 3 -> 9 -> 6
Anagram grouping question asked in an interview
1st and 2nd round they asked coding questions. First round is coding, second is system design 3rd is cultural and behavior round. In 2nd round interviewer was not ready with questions. He asks to implement binary search. Then asks me to add code to build the tree. Next asked to delete a node things like that. It felt that he was just wanted to kill time. In 3rd round he asked me what do I do after my work. Twice. same question two times.
basic question regarding sorting, etc
Qt C++ related UI questions, database basics
Check design routing flow using graph. BSF/DFS based questions. Binary tree traversal questions. Graph algorithm questions
How to detect cycles in a undirected graph using the union-find data structure?
Intensive domain knowledge. Some c++ questions. Rarely any coding problems.
What motivates you?
Explanation of the project and process improvements
Viewing 3581 - 3590 interview questions