Data Structure

    • DS Tutorial
    • DS Introduction
    • DS Algorithm
    • Asymptotic Analysis
    • DS Pointer
    • DS Structure
  • DS Array
    • DS Array
    • 2D Array
  • DS Linked List
    • DS Linked List
    • Types of Linked List
    • Singly Linked List
    • Doubly Linked List
    • Circular Linked List
    • Circular Doubly List
    • Skip List in DS
  • DS Stack
    • DS Stack
    • Array Implementation
    • Linked List Implementation
  • DS Queue
    • DS Queue
    • Types of Queues
    • Array Representation
    • Linked List Representation
    • Circular Queue
    • Deque
    • Priority Queue
  • DS Tree
    • DS Tree
    • Binary Tree
    • Binary Search Tree
    • AVL Tree
    • B Tree
    • B+ Tree
  • DS Graph
    • DS Graph
    • Graph Implementation
    • BFS Algorithm
    • DFS Algorithm
    • Spanning Tree
  • DS Searching
    • Linear Search
    • Binary Search
  • DS Sorting
    • Bubble Sort
    • Bucket Sort
    • Comb Sort
    • Counting Sort
    • Heap Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
    • Radix Sort
    • Selection Sort
    • Shell Sort
    • Bitonic Sort
    • Cocktail Sort
    • Cycle Sort
    • Tim Sort
  • Differences
    • Linear vs Non-linear
    • Array vs Linked List
    • Stack vs Queue
    • Linear vs Circular Queue
    • Linear Search vs Binary Search
    • Singly Linked List vs Doubly Linked List
    • Binary vs Binary Search Tree
    • Tree vs Graph
    • Binary Search Tree vs AVL Tree
    • Red-Black Tree vs AVL Tree
    • B Tree vs B+ Tree
    • Quick Sort vs Merge Sort
    • BFS vs DFS
    • Stack vs Heap
    • Bubble Sort vs Selection Sort
    • Stack vs Array
    • Full Binary Tree vs Complete Binary Tree
    • Binary Tree vs B Tree
    • Primitive vs Non-primitive Data Structure
    • Data Types vs Data Structure

MISC

  1. Trie Data Structure
  2. Heap Data Structure
  3. Splay Tree
  4. Fundamental of the DS
  5. Hash Table
  6. Preorder Traversal
  7. Tree Traversal
  8. Implementation of Queue using Stacks
  9. Implementation of Stack using Queue
  10. Binomial Heap
  11. Postorder Traversal
  12. Sparse Matrix
  13. Detect Loop in a Linked List
  14. Inorder Traversal
  15. Convert Infix to Postfix Notation
  16. Convert Infix to Prefix Notation
  17. Conversion of Prefix to Postfix Expression
  18. Conversion of Postfix to Prefix Expression
  19. Remove the Loop in a Linked List
  20. Implement Two Stacks in an Array
  21. Reverse a Stack using Recursion
  22. Detect Cycle in a Directed Graph
  23. Optimal Binary Search Tree
  24. Priority Queue using Linked List
  25. Balanced Binary Search Tree
  26. Boundary Traversal of Binary Tree
  27. Diagonal Traversal of Binary Tree
  28. Vertical Traversal of a Binary Tree
  29. Graph Algorithms
  30. Time Complexity of Sorting Algorithms
  31. Applications of Stack in Data Structure
  32. Dictionary Data Structure
  33. Structured Data and Unstructured Data
  34. List Data Structure
  35. Types of Tree in Data Structure
  36. Abstract Data Type in Data Structure
  37. Disjoint Set Data Structure
  38. Dynamic Data Structure
  39. Hash Function in Data Structure
  40. Complete Binary Tree
  41. Threaded Binary Tree
  42. Diameter of Binary Tree
  43. Height of Binary Tree
  44. Inorder Tree Traversal without Stack
  45. Enumeration of Binary Trees
  46. Maximum Width of a Binary Tree
  47. Types of Graph in Data Structure
  48. Primitive Data Type
  49. Semi-Structured Data
  50. Advance Data Structures
  51. Sort an Array of 0’s, 1’s, and 2’s
  52. Stock Span Problem
  53. Implementation of Deque by Circular Array
  54. Rotate Operation in Linked List
  55. Subarray with Given Sum
  56. Self-Organizing List
  57. Unrolled Linked List
  58. Types of Sparse Matrices
  59. Application of Linked List
  60. Topological Sorting
  61. Ternary Search Tree
  62. Stock Span Problem
  63. Treap Data Structure
  64. Quicksort on Doubly Linked List
  65. Inversion Count
  66. Expression Tree in DS
  67. Garbage Collection in DS
  68. Merge Sort on Doubly Linked List
  69. Sort Stack using Recursion
  70. LIFO Approach in Data Structure
  71. Big O Notation in DS
  72. Binary Tree Traversal in DS
  73. Queue Operations in DS
  74. What is a Non-Linear Data Structure
  75. FIFO Approach in Data Structure
  76. Connected Graphs in Data Structure
  77. Python Data Structure (Immutable)
  78. Data Structure Used by Map
  79. Iteration in Data Structure
  80. Linear Search and Binary Search in DS
  81. Hash Table vs. STL Map
  82. Recaman’s Sequence
  83. Maximum Area Rectangle created by selecting four sides from an array
  84. Maximum number of distinct nodes in a root-to-leaf path
  85. Hashing – Open Addressing for Collision Handling
  86. Introduction to Hashing
  87. Separate Chaining for Collision Handling
  88. Check if a given array contains duplicate elements within k distance from each other
  89. Given an array A[] and a number x, check for pair in A[] with sum as x (aka Two Sum)
  90. Find number of Employees Under every Manager
  91. Union and Intersection of two Linked Lists
  92. Kth Largest element in an array
  93. Sort an almost-sorted, k-sorted or nearly-sorted array
  94. Fibonacci Heap
  95. Find whether an array is a subset of another array
  96. Print a Binary Tree in Vertical Order
  97. Tournament Tree (Winner Tree)
  98. Lazy Propagation in Segment Tree
  99. Segment Tree – Range Minimum Query
  100. Segment Tree – Sum of given Range
  101. 2-3 Trees (Search, Insertion, and Deletion)
  102. Print kth least significant bit of a number
  103. Add two numbers represented by linked lists
  104. Adding one to the number represented as an array of digits
  105. Find the number N, where (N+X) is divisible by Y and (N-Y) is divisible by X
  106. Find values of P and Q satisfying the equation N = P^2.Q
  107. Find if a binary tree satisfies the balanced height property
  108. AVL Tree Advantages
  109. AVL Tree Time Complexity
  110. Merge Two Binary Trees
  111. Stack Operations in Data Structure
  112. Self-Balancing Binary Search Trees
  113. Sliding Window Maximum (Maximum of all Subarrays of size K)
  114. AVL Trees Operations
  115. Limitations of Stack in Data Structures
  116. Representation of Stack in Data Structure
  117. Advantages of Threaded Binary Tree
  118. Serialize and Deserialize a Binary Tree
  119. Application of Binary Tree
  120. AVL Tree Applications
  121. B Tree Visualization
  122. Properties of AVL Trees
  123. Push and Pop Operation in Stack in Data Structure
  124. Binary Search Tree Implementation
  125. Find Maximum Sum by Replacing the Subarray in a Given Range
  126. Find The Number N, Where (N+X) Divisible By Y And (N-Y) Divisible By X
  127. Find Values of P and Q Satisfying the Equation N = P^2.Q
  128. What is the Balance Factor of AVL Tree
  129. AVL Tree Implementation in Golang
  130. Concatenation of two Linked Lists in O(1) time
  131. Find Minimum Area of Rectangle Formed from Given Shuffled Coordinates
  132. Find the Length of Maximum Path in Given Matrix for Each Index
  133. How to Parse an Array of Objects in C++ Using RapidJson
  134. Largest BST in Binary Tree
  135. How to Print String Literal and QString With Qdebug in C++
  136. Properties of Binary Tree
  137. Right View of Binary Tree
  138. Strict Binary Tree
  139. Difference between Comb Sort and Shell Sort
  140. Full Binary Tree
  141. Left View of a Binary Tree
  142. Level Order Traversal in a Binary Tree
  143. Lowest Common Ancestor in a Binary Search Tree
  144. Types of Binary Trees
  145. B Tree Insertion
  146. Evaluation of a Postfix Notation
  147. B+ Tree Insertion
  148. Bottom View of a Binary Tree
  149. AVL Tree Program in C
  150. B Tree Applications
  151. B Tree Properties
  152. How to Search, Insert, and Delete in an Unsorted Array
  153. Count Non-Leaf Nodes in a Binary Tree
  154. Get the Level of a Given Key in a Binary Tree
  155. Double Ended Priority Queue
  156. B+ Tree Deletion
  157. B+ Tree Insertion
  158. Hashing in Data Structure
  159. Primitive Data Structure
  160. Find if Binary Tree Satisfies Balanced Height Property
  161. Find the Largest Perfect Binary Tree in a Given Tree
  162. Find Immediate Parents of Two Nodes in a Binary Tree
  163. Applications, Advantages, and Disadvantages of Circular Doubly Linked List
  164. Sorting Techniques in Data Structures
  165. Find Clockwise Array in Binary Search Tree
  166. Find Duplicate Subtrees in Binary Tree
  167. Find the Index of the Number Using a Binary Tree
  168. Find the In-Order Successor of a Node in a Binary Tree
  169. Reversing a Queue
  170. Different Types of Stack Operations
  171. Time Complexity in Data Structure
  172. Arrays are the Best Data Structure
  173. Dynamic Memory Allocation in Data Structure
  174. Application of Data Structure
  175. Applications of Tree in Data Structure
  176. How to Check if a Binary Number is Divisible by 3
  177. Stock Buy and Sell Problem
  178. Find Minimum in Rotated Sorted Array
  179. Interpolation Search vs. Binary Search
  180. Boggle (find all possible words in a board of characters)
  181. Difference Between Prim’s and Kruskal’s algorithm in Hindi
  182. Interpolation Search in Hindi
  183. Quick Sort Using Hoare’s Partition in Hindi
  184. DS MCQ in Hindi
  185. Data Structure MCQ in Hindi
  186. Advanced DS MCQ in Hindi