How do you find bridges and articulation points in a graph?

Heisenbug logo
TheHeisenBug

Search

Search across questions, learning content, and hands-on projects

Ace Your Next Tech Interview

5,986+ interview questions across 87 technologies — with expert answers, advanced search, AI-powered assistance, personal highlights, structured learning paths, and hands-on practice projects.

5,986+Questions & Answers
87Technologies
AdvancedSearch
Built-inAsk AI
PersonalHighlights
StructuredLearning Paths
Hands-onPractice Projects

Lifetime Access

One-time payment. No subscriptions. Unlock everything, forever.

$19.90USD

or R$49.90 BRL

FeatureFreePremium
Question titlesAllAll
Answers per topicTop 5All
Learning chaptersFirst 5All
Practice projectsFirst 3All
Highlights✓✓
Ask AI—✓
Read tracking✓✓
Search✓✓

Data Structures Interview Questions

  1. [JUNIOR] What is a data structure and why are data structures important?
  2. [JUNIOR] What is an array and what are its common applications?
  3. [JUNIOR] What is the difference between a stack and a queue?
  4. [JUNIOR] What is the difference between linear and non-linear data structures?
  5. [JUNIOR] What is a linked list and what are the different types of linked lists?
  6. [JUNIOR] What is a stack and what are its applications?
  7. [JUNIOR] What is a queue and what are its applications?
  8. [JUNIOR] What is Big O notation and why is it important for evaluating data structures?
  9. [MID] How do you implement a queue using two stacks?
  10. [MID] How does a hash map handle collisions and what are the common strategies?
  11. [MID] How does binary search work and what is its time complexity?
  12. [MID] How would you reverse a linked list?
  13. [MID] How do you detect a cycle in a linked list?
  14. [MID] What is the difference between BFS and DFS and when would you use each?
  15. [SENIOR] How would you implement an LRU cache and which data structures would you use?
  16. [JUNIOR] What is the difference between an array and a linked list?
  17. [JUNIOR] What is a hash map and how does it store key-value pairs?
  18. [JUNIOR] What is a binary tree?
  19. [MID] How do you implement a stack using two queues?
  20. [MID] What are in-order, pre-order, and post-order tree traversals and when is each used?
  21. [MID] What is a trie data structure and what are its applications?
  22. [MID] How would you validate balanced parentheses using a stack?
  23. [MID] How do you find the maximum depth of a binary tree?
  24. [SENIOR] How would you design a data structure that supports insert, delete, and get random element all in O(1) time?
  25. [SENIOR] How does Dijkstra's algorithm find the shortest path and what data structures does it use?
  26. [JUNIOR] What are FIFO and LIFO principles?
  27. [JUNIOR] What is a binary search tree and how does it differ from a binary tree?
  28. [JUNIOR] What is a graph data structure and how can it be represented?
  29. [MID] How would you check if a given binary tree is a valid binary search tree?
  30. [MID] What are infix, prefix, and postfix notations and how do you convert between them?
  31. [MID] How would you merge two sorted linked lists?
  32. [MID] How would you find the lowest common ancestor in a binary search tree?
  33. [MID] What is hashing and what makes a good hash function?
  34. [MID] What are the differences between Quick Sort, Merge Sort, and Heap Sort?
  35. [SENIOR] What is a B-tree and how is it optimized for disk-based storage?
  36. [SENIOR] What is a Red-Black tree and how does it maintain balance?
  37. [SENIOR] How would you serialize and deserialize a binary tree?
  38. [SENIOR] How would you find the median from a continuous data stream?
  39. [SENIOR] How would you solve the trapping rain water problem?
  40. [JUNIOR] What is a heap data structure?
  41. [JUNIOR] What is recursion and how is it used with data structures?
  42. [JUNIOR] What is a multidimensional array and when would you use one?
  43. [MID] What is an AVL tree and why is self-balancing important?
  44. [MID] What is topological sorting and when is it used?
  45. [MID] How does a circular queue work and what problem does it solve over a linear queue?
  46. [MID] How would you find the kth smallest element in a binary search tree?
  47. [SENIOR] What is a segment tree and what problems does it solve efficiently?
  48. [SENIOR] How does a skip list work and what advantages does it offer over balanced BSTs?
  49. [SENIOR] What is the difference between Prim's and Kruskal's algorithms for minimum spanning trees?
  50. [SENIOR] How would you implement a trie-based autocomplete system?
  51. [SENIOR] How would you merge K sorted linked lists efficiently?
  52. [JUNIOR] What is a priority queue and how does it differ from a regular queue?
  53. [JUNIOR] What is a deque and how does it differ from a regular queue?
  54. [MID] What is the difference between a min-heap and a max-heap?
  55. [MID] What is the next greater element problem and how do you solve it using a stack?
  56. [MID] How do you construct a binary tree from its pre-order and in-order traversals?
  57. [SENIOR] What is a Bloom filter and when would you use one?
  58. [SENIOR] How do you detect strongly connected components in a directed graph?
  59. [SENIOR] How do you find bridges and articulation points in a graph?
  60. [SENIOR] How would you implement a binary tree's level-order traversal and what is its time complexity?
  61. [EXPERT] What are the performance implications of different hash collision resolution strategies at scale?
  62. [JUNIOR] What is the difference between a singly linked list, a doubly linked list, and a circular linked list?
  63. [MID] How does the selection sort algorithm work and what is its time complexity?
  64. [SENIOR] What is the largest rectangle in histogram problem and how do you solve it using a stack?
  65. [EXPERT] How do B+ trees differ from B-trees and why are they preferred for database indexing?
  66. [EXPERT] How do persistent (immutable) data structures work and what are their practical applications?
  67. [EXPERT] How would you design a thread-safe LRU cache for a concurrent system?
  68. [SENIOR] What is a spanning tree and what is the maximum number of spanning trees a graph can have?
  69. [EXPERT] What are lock-free and wait-free data structures and when would you use them?
  70. [EXPERT] What is amortized time complexity analysis and how does it apply to dynamic arrays?
  71. [EXPERT] How does a suffix tree or suffix array work and what problems do they solve efficiently?
  72. [EXPERT] How do LSM trees work and why are they used in write-heavy storage systems?
  73. [EXPERT] What are cache-oblivious data structures and how do they optimize memory access patterns?
  74. [EXPERT] What is consistent hashing and how does it apply to distributed data structures?