Questions
53 of 59
1What is the time complexity of BFS and DFS?
2What is Union-Find (Disjoint Set Union)? Explain Path Compression and Union by Rank.
3Is Heap Sort stable? Is Merge Sort stable?
4What is a Suffix Tree/Array? What string problems does it solve?
5What is a Van Emde Boas tree?
6What is the difference between Directed and Undirected Graphs?
7What is Counting Sort? What are its limitations?
8Explain Dijkstra's Algorithm. When does it fail?
9What is the difference between Kruskal's and Prim's? When is one preferred?
10Explain Merge Sort. What is its time and space complexity?
11What is a Graph? Define Vertex, Edge, Degree.
12What is the precondition for Binary Search?
13How does the Garbage Collector interact with data structures? (Weak references, Gen0/Gen1/Gen2)
14Explain Floyd-Warshall Algorithm (All Pairs Shortest Path).
15Explain Adjacency Matrix. What are its pros and cons?
16What is the difference between Linear Search and Binary Search?
17What is Radix Sort? How does it handle strings?
18How do you find the shortest path in an unweighted graph?
19How do you find the median of a stream of numbers?
20Why is Insertion Sort preferred for small or nearly sorted arrays?
21Compare Merge Sort vs Quick Sort. When do you choose which?
22Explain Kruskal's Algorithm. Which data structure is crucial for it?
23Which representation is better for Sparse vs Dense graphs?
24What is a Directed Acyclic Graph (DAG)? Why are they important in build systems?
25Explain Strongly Connected Components (Kosaraju/Tarjan).
26Explain the concept of Cache Oblivious algorithms.
27How do you design a Data Structure that supports insert, delete, search, and getRandom in O(1)?
28What is Topological Sorting? Which algorithm is used?
29Explain Prim's Algorithm.
30Explain Breadth-First Search (BFS). What data structure does it use?
31What is an LRU Cache? How do you implement it using a Hash Map and Doubly Linked List?
32What is an LFU Cache? How is it different from LRU?
33Explain the concept of Stability in sorting. Why does it matter for multi-key sorting?
34What is a Weighted Graph?
35How do you detect a cycle in a Directed Graph?
36How do you detect a Deadlock using a Graph?
37What is the Median of Medians algorithm? Why is it better than random pivot selection?
38What is a Treap? How does it combine BST and Heap properties?
39How do you solve a Maze using Graph algorithms?
40What is a Bloom Filter? How do you calculate the False Positive rate?
41What is Heap Sort? How does it work?
42What is a Bipartite Graph? How do you check for it?
43Explain Bellman-Ford Algorithm. Why is it slower than Dijkstra?
44What is a Minimum Spanning Tree (MST)?
45How do you detect a cycle in an Undirected Graph?
46Write down the time complexities of Bubble, Selection, Insertion Sort.
47What is a Persistent Data Structure?
48What is the difference between a Binary Heap and a Fibonacci Heap? Why is Fibonacci Heap theoretically faster for Dijkstra's?
49What is a Bucket Sort? When is it effective?
50What is the difference between Dijkstra and A* (A-star)?
51How do you find the k-th largest element in an array?
52What is the fastest possible time complexity for a comparison-based sort? Why?
53Explain Adjacency List. What are its pros and cons?
54Explain Depth-First Search (DFS). What data structure does it use?
55Explain Quick Sort. What is its worst-case complexity? How do you avoid it?
56How are Data Structures used in Database Indexing? (B+ Trees, Hash Indexes)
57What is a Cyclic vs Acyclic Graph?
58What is the difference between a Tree and a Graph?
59What is the difference between Internal and External Sorting?
