nextRound
TechnologiesCoding ProblemsBookmarksLearning PathsLogin
nextRound
TechnologiesCoding ProblemsBookmarksLearning PathsLogin
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
  • Mock Interviews
  • Saved Questions
  • Pricing

Company

  • About Us
  • Contact Us

Legal

  • Privacy Policy
  • Terms of Use

© 2026 nextRound. All rights reserved.

1What is a Graph? Define Vertex, Edge, Degree.Beginner2What is the difference between Directed and Undirected Graphs?Beginner3What is a Weighted Graph?Beginner4What is a Cyclic vs Acyclic Graph?Beginner5What is the difference between a Tree and a Graph?Beginner6Explain Adjacency Matrix. What are its pros and cons?Intermediate7Explain Adjacency List. What are its pros and cons?Intermediate8Which representation is better for Sparse vs Dense graphs?Beginner9Explain Breadth-First Search (BFS). What data structure does it use?Beginner10Explain Depth-First Search (DFS). What data structure does it use?Beginner11What is the time complexity of BFS and DFS?Beginner12What is Topological Sorting? Which algorithm is used?Advanced13How do you detect a cycle in a Directed Graph?Advanced14How do you detect a cycle in an Undirected Graph?Intermediate15Explain Dijkstra's Algorithm. When does it fail?Advanced16Explain Bellman-Ford Algorithm. Why is it slower than Dijkstra?Advanced17What is the difference between Dijkstra and A* (A-star)?Advanced18What is a Minimum Spanning Tree (MST)?Intermediate19Explain Kruskal's Algorithm. Which data structure is crucial for it?Advanced20Explain Prim's Algorithm.Advanced21What is the difference between Kruskal's and Prim's? When is one preferred?Advanced22What is Union-Find (Disjoint Set Union)? Explain Path Compression and Union by Rank.Advanced23What is a Bipartite Graph? How do you check for it?Advanced24How do you find the shortest path in an unweighted graph?Beginner25Explain Strongly Connected Components (Kosaraju/Tarjan).Advanced26What is a Directed Acyclic Graph (DAG)? Why are they important in build systems?Intermediate27How do you solve a Maze using Graph algorithms?Intermediate28Explain Floyd-Warshall Algorithm (All Pairs Shortest Path).Advanced29How do you detect a Deadlock using a Graph?Advanced30What is the difference between Linear Search and Binary Search?Beginner31What is the precondition for Binary Search?Beginner32Write down the time complexities of Bubble, Selection, Insertion Sort.Beginner33Why is Insertion Sort preferred for small or nearly sorted arrays?Intermediate34Explain Merge Sort. What is its time and space complexity?Intermediate35Explain Quick Sort. What is its worst-case complexity? How do you avoid it?Advanced36Compare Merge Sort vs Quick Sort. When do you choose which?Intermediate37What is Heap Sort? How does it work?Intermediate38Is Heap Sort stable? Is Merge Sort stable?Beginner39What is Counting Sort? What are its limitations?Intermediate40What is Radix Sort? How does it handle strings?Advanced41What is the fastest possible time complexity for a comparison-based sort? Why?Advanced42What is the difference between Internal and External Sorting?Advanced43How do you find the k-th largest element in an array?Advanced44How do you find the median of a stream of numbers?Advanced45What is a Bucket Sort? When is it effective?Intermediate46Explain the concept of Stability in sorting. Why does it matter for multi-key sorting?Intermediate47What is a Persistent Data Structure?Advanced48What is a Treap? How does it combine BST and Heap properties?Advanced49What is a Bloom Filter? How do you calculate the False Positive rate?Advanced50What is an LRU Cache? How do you implement it using a Hash Map and Doubly Linked List?Advanced51What is an LFU Cache? How is it different from LRU?Advanced52What is a Suffix Tree/Array? What string problems does it solve?Advanced53What is a Van Emde Boas tree?Advanced54How do you design a Data Structure that supports insert, delete, search, and getRandom in O(1)?Advanced55What is the Median of Medians algorithm? Why is it better than random pivot selection?Advanced56Explain the concept of Cache Oblivious algorithms.Advanced57What is the difference between a Binary Heap and a Fibonacci Heap? Why is Fibonacci Heap theoretically faster for Dijkstra's?Advanced58How are Data Structures used in Database Indexing? (B+ Trees, Hash Indexes)Advanced59How does the Garbage Collector interact with data structures? (Weak references, Gen0/Gen1/Gen2)Advanced
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.