Common interview questions organized by role and topic. Practice before your big day.
22 questions across 3 topics
Explain time complexity of common sorting algorithms (QuickSort, MergeSort, HeapSort)
Implement a binary search tree with insert, delete, and search operations
How would you detect a cycle in a linked list? (Floyd's algorithm)
Explain the difference between BFS and DFS. When would you use each?
Solve: Given an array, find two numbers that sum to a target (Two Sum)
What is dynamic programming? Solve the coin change problem
Explain hash maps — how do they handle collisions?
Implement a stack using two queues
What is a trie? When would you use it over a hash map?
Explain graph algorithms: Dijkstra's, Kruskal's, Prim's