nextRound
TechnologiesCoding ProblemsBookmarksLearning Paths
nextRound
TechnologiesCoding ProblemsBookmarksLearning Paths
nextRound

AI-powered interview preparation platform. Practice with curated questions, mock interviews, and personalized learning paths to crack your dream tech interview.

Quick Links

  • Technologies
  • Saved Questions
  • Pricing

Company

  • About Us
  • Contact Us

Legal

  • Privacy Policy
  • Terms of Use

© 2026 nextRound. All rights reserved.

1What is the time complexity of BFS and DFS?Beginner2What is Union-Find (Disjoint Set Union)? Explain Path Compression and Union by Rank.Intermediate3Is Heap Sort stable? Is Merge Sort stable?Intermediate4What is a Suffix Tree/Array? What string problems does it solve?Advanced5What is a Van Emde Boas tree?Advanced6What is the difference between Directed and Undirected Graphs?Intermediate7What is Counting Sort? What are its limitations?Intermediate8Explain Dijkstra's Algorithm. When does it fail?Intermediate9What is the difference between Kruskal's and Prim's? When is one preferred?Intermediate10Explain Merge Sort. What is its time and space complexity?Intermediate11What is a Graph? Define Vertex, Edge, Degree.Beginner12What is the precondition for Binary Search?Beginner13How does the Garbage Collector interact with data structures? (Weak references, Gen0/Gen1/Gen2)Intermediate14Explain Floyd-Warshall Algorithm (All Pairs Shortest Path).Intermediate15Explain Adjacency Matrix. What are its pros and cons?Intermediate16What is the difference between Linear Search and Binary Search?Beginner17What is Radix Sort? How does it handle strings?Intermediate18How do you find the shortest path in an unweighted graph?Beginner19How do you find the median of a stream of numbers?Intermediate20Why is Insertion Sort preferred for small or nearly sorted arrays?Beginner21Compare Merge Sort vs Quick Sort. When do you choose which?Intermediate22Explain Kruskal's Algorithm. Which data structure is crucial for it?Intermediate23Which representation is better for Sparse vs Dense graphs?Intermediate24What is a Directed Acyclic Graph (DAG)? Why are they important in build systems?Intermediate25Explain Strongly Connected Components (Kosaraju/Tarjan).Intermediate26Explain the concept of Cache Oblivious algorithms.Advanced27How do you design a Data Structure that supports insert, delete, search, and getRandom in O(1)?Intermediate28What is Topological Sorting? Which algorithm is used?Intermediate29Explain Prim's Algorithm.Intermediate30Explain Breadth-First Search (BFS). What data structure does it use?Intermediate31What is an LRU Cache? How do you implement it using a Hash Map and Doubly Linked List?Intermediate32What is an LFU Cache? How is it different from LRU?Intermediate33Explain the concept of Stability in sorting. Why does it matter for multi-key sorting?Intermediate34What is a Weighted Graph?Beginner35How do you detect a cycle in a Directed Graph?Intermediate36How do you detect a Deadlock using a Graph?Intermediate37What is the Median of Medians algorithm? Why is it better than random pivot selection?Advanced38What is a Treap? How does it combine BST and Heap properties?Intermediate39How do you solve a Maze using Graph algorithms?Intermediate40What is a Bloom Filter? How do you calculate the False Positive rate?Intermediate41What is Heap Sort? How does it work?Intermediate42What is a Bipartite Graph? How do you check for it?Intermediate43Explain Bellman-Ford Algorithm. Why is it slower than Dijkstra?Intermediate44What is a Minimum Spanning Tree (MST)?Intermediate45How do you detect a cycle in an Undirected Graph?Intermediate46Write down the time complexities of Bubble, Selection, Insertion Sort.Beginner47What is a Persistent Data Structure?Intermediate48What is the difference between a Binary Heap and a Fibonacci Heap? Why is Fibonacci Heap theoretically faster for Dijkstra's?Advanced49What is a Bucket Sort? When is it effective?Intermediate50What is the difference between Dijkstra and A* (A-star)?Intermediate51How do you find the k-th largest element in an array?Intermediate52What is the fastest possible time complexity for a comparison-based sort? Why?Intermediate53Explain Adjacency List. What are its pros and cons?Beginner54Explain Depth-First Search (DFS). What data structure does it use?Beginner55Explain Quick Sort. What is its worst-case complexity? How do you avoid it?Intermediate56How are Data Structures used in Database Indexing? (B+ Trees, Hash Indexes)Intermediate57What is a Cyclic vs Acyclic Graph?Intermediate58What is the difference between a Tree and a Graph?Beginner59What is the difference between Internal and External Sorting?Intermediate
All Topics
1
Basics
Complexity Analysis
2
Arrays and Strings
Linked Lists
Stacks and Queues
Hash Tables
3
Trees
Graphs
Sharethis topic

Share via WhatsApp, X, Facebook, LinkedIn or copy link. Open Graph preview enabled.