Telephonic: Given a binary tree of numbers and a search number has given, find out first occurence of that number and smallest distance from root node. if you have given k search numbers find their occurence and nearest from root node in a single walk.
Find the minimum number of steps required to change a 4-digit prime number to another prime number (if possible), such that each intermediate number formed after each change is also a prime
What is your experience in Linux?
Data Structures and Algorithms related to Graphs, Trees, Searching, Sorting, String manipulation, etc
How to restart the server without stopping the current process?(I am not sure if it is correct, because I really do not know about the question)
A lot of questions regarding multi-threaded programming. Questions regarding API design as well as data structures (linked list/hash map).
What is multiple inheritance? Difference between const int * p and int * const p?
Round 1 => DSA Round 2 => HLD Round 3 => LLD Round 4 => DSA Round 5 => Manager Round 6 => Director
How do you feel about this spot you applied for ?
Will I be able to handle the workload?
Viewing 1501 - 1510 interview questions