DSAWiser

DSA question set · 170 questions

Divide and Conquer DSA Practice Questions

Explore 170 DSA questions in Divide and Conquer. Practice with DSAWiser’s code editor and visualizer.

Divide and ConquerArrayMathSortingStringBinary SearchTreeRecursionMatrixBit ManipulationPrefix SumGeometryDynamic ProgrammingBacktrackingGraphSegment TreeUnion Find

What’s in this set

The Divide and Conquer collection contains 170 problems: 54 basic, 41 easy, 40 medium, 26 hard, 9 very hard. Choose a question at your current level, or follow the collection’s order below.

Topics in this collection include Divide and Conquer, Array, Math, Sorting, String. Each question shows its own topics and difficulty so you can decide where to begin.

Practice with the code visualizer

  1. Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
  2. Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
  3. Step through your code in the visualizer. Use a breakpoint to inspect the state at a specific line, then compare it with your reasoning.

Questions in this set

170 total

Open a question in the editor to read its statement and examples. Sign in to practice.

  1. Split Array into Left and Right HalvesDivide and Conquer · ArrayBasic
  2. Sum of Array via Divide and ConquerDivide and Conquer · ArrayBasic
  3. Maximum Element via Divide and ConquerDivide and ConquerBasic
  4. Minimum Element via Divide and ConquerDivide and ConquerBasic
  5. Count Occurrences of Target via Divide and ConquerDivide and ConquerBasic
  6. Product of Array Elements via Divide and ConquerDivide and Conquer · Array · MathBasic
  7. Count Even Numbers via Divide and ConquerDivide and ConquerBasic
  8. Check if All Elements are PositiveDivide and ConquerBasic
  9. Simultaneous Minimum and Maximum via Divide and ConquerDivide and ConquerBasic
  10. Combine Step: Merge Two Sorted HalvesDivide and Conquer · Array · SortingBasic
  11. Array Length via Divide and ConquerDivide and Conquer · ArrayBasic
  12. Integer Power via Binary Exponentiation (Divide and Conquer)Divide and Conquer · MathBasic
  13. Count Target Character in String via Divide and ConquerDivide and Conquer · StringBasic
  14. Check if Two Halves of Array are IdenticalDivide and Conquer · ArrayBasic
  15. Compare Maximums of Left and Right HalvesDivide and Conquer · ArrayBasic
  16. Count Vowels in String via Divide and ConquerDivide and Conquer · StringBasic
  17. Reverse Array by Swapping Halves (Recursive Reversal)Divide and Conquer · ArrayBasic
  18. Both Halves Strictly Increasing CheckDivide and Conquer · ArrayBasic
  19. Binary Search Base Decision (Single Division Step)Divide and Conquer · Binary SearchBasic
  20. Element-wise Sum of Two HalvesDivide and Conquer · ArrayBasic
  21. Number of Division Levels to Reach Base CaseDivide and ConquerBasic
  22. Count Total Base Cases (Leaves) in Division TreeDivide and Conquer · Tree · RecursionBasic
  23. Absolute Difference Between Sum of Left and Right HalvesDivide and Conquer · ArrayBasic
  24. Count Negative Numbers via Divide and ConquerDivide and ConquerBasic
  25. Combine Step: Alternating Interleave of Two HalvesDivide and Conquer · ArrayBasic
  26. Count Zeros via Divide and ConquerDivide and ConquerBasic
  27. Cross-Half Spread: Max of Right Minus Min of LeftDivide and ConquerBasic
  28. Check if String is Palindrome via HalvesDivide and Conquer · Array · StringBasic
  29. Count Total Division Steps in Recursion TreeDivide and Conquer · Tree · RecursionBasic
  30. Combine Step: Merge Ascending Halves into Descending ArrayDivide and Conquer · Array · SortingBasic
  31. Count Elements Exceeding Threshold via Divide and ConquerDivide and ConquerBasic
  32. Divide and Conquer Search: Binary Search IndexDivide and Conquer · Binary SearchBasic
  33. Verify Array is Sorted via Divide and ConquerDivide and Conquer · Array · SortingBasic
  34. First Occurrence in Left Half Before Right HalfDivide and ConquerBasic
  35. Combine Step: Merge Two Unsorted Halves After Independent SortingDivide and Conquer · Array · SortingBasic
  36. Count Odd Numbers via Divide and ConquerDivide and ConquerBasic
  37. Boundary Crossing Pair SumDivide and ConquerBasic
  38. Divide String into Four QuartersDivide and Conquer · StringBasic
  39. Boolean Target Existence Search via Divide and ConquerDivide and ConquerBasic
  40. Combine Step: Merge Two Sorted Arrays with Duplicate EliminationDivide and Conquer · Array · SortingBasic
  41. Average of Array Elements via Divide and ConquerDivide and Conquer · Array · MathBasic
  42. Base Inversion Check (Pair of Elements)Divide and ConquerBasic
  43. Power-of-Two Array Size Check for Perfect HalvingDivide and Conquer · Array · MathBasic
  44. Count Upper and Lower Case Letters via Divide and ConquerDivide and ConquerBasic
  45. Combine Step: Merge and Count ComparisonsDivide and Conquer · Array · SortingBasic
  46. Left-Heavy vs Right-Heavy Array Sum ComparisonDivide and Conquer · ArrayBasic
  47. Maximum Subarray Sum of Length at Most 2 via Divide and ConquerDivide and Conquer · ArrayBasic
  48. Invert Array Signs via Divide and ConquerDivide and Conquer · ArrayBasic
  49. Compare Minimums of Left and Right HalvesDivide and Conquer · ArrayBasic
  50. Quicksort Divide Invariant Check (Partition Verification)Divide and Conquer · Array · SortingBasic
  51. Karatsuba Multiplication Base Step (Two-Digit Splitting)Divide and Conquer · MathBasic
  52. Quadtree Quadrant Splitting and Sign InversionDivide and Conquer · MatrixBasic
  53. Count Occupied Points in Four Quadtree QuadrantsDivide and Conquer · MatrixBasic
  54. Defective Chessboard Tiling with L-TrominoesDivide and ConquerBasic
  55. Merge Sort AlgorithmDivide and Conquer · Array · SortingEasy
  56. Majority Element via Divide and ConquerDivide and ConquerEasy
  57. Pow(x, n) with Exact Four-Decimal RoundingDivide and Conquer · MathEasy
  58. Search Insert PositionDivide and Conquer · Binary SearchEasy
  59. Convert Sorted Array to Height-Balanced BSTDivide and Conquer · Array · Sorting · Tree · RecursionEasy
  60. Maximum Depth of Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  61. Invert Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  62. Peak Index in a Mountain ArrayDivide and Conquer · Array · Binary SearchEasy
  63. Longest Common Prefix via Divide and ConquerDivide and Conquer · StringEasy
  64. Merge Two Binary Trees via Divide and ConquerDivide and Conquer · Array · Sorting · Tree · RecursionEasy
  65. Minimum Depth of Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  66. First Bad Version: Deterministic Binary Search TraceDivide and Conquer · Binary SearchEasy
  67. Search a 2D Matrix (Flattened Divide and Conquer)Divide and Conquer · MatrixEasy
  68. Guess Number: Deterministic Bisection TraceDivide and Conquer · Binary SearchEasy
  69. Symmetric Tree via Divide and Conquer (Mirror Check)Divide and Conquer · Tree · RecursionEasy
  70. Balanced Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  71. Integer Square Root via Divide and ConquerDivide and Conquer · Binary SearchEasy
  72. Quicksort Divide Step: Lomuto Partition SchemeDivide and Conquer · Array · SortingEasy
  73. Same Tree Check via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  74. Count Elements Less Than or Equal to Target (Upper Bound Search)Divide and Conquer · Binary SearchEasy
  75. Number of 1 Bits (Divide and Conquer Bit Folding)Divide and Conquer · Bit ManipulationEasy
  76. Reverse Bits via Divide and ConquerDivide and Conquer · Bit ManipulationEasy
  77. Range Sum of BST via Divide and ConquerDivide and Conquer · Tree · Recursion · Prefix SumEasy
  78. Valid Perfect Square via Divide and ConquerDivide and Conquer · Binary SearchEasy
  79. Inorder Traversal via Divide and ConquerDivide and ConquerEasy
  80. Preorder Traversal via Divide and ConquerDivide and ConquerEasy
  81. Postorder Traversal via Divide and ConquerDivide and ConquerEasy
  82. Strassen’s Matrix Multiplication Base Step (2x2 Product)Divide and Conquer · Matrix · MathEasy
  83. Sum of Leaf Nodes in Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  84. Maximum Value in a Binary Search Tree via Divide and ConquerDivide and Conquer · Binary Search · Tree · RecursionEasy
  85. Minimum Value in a Binary Search Tree via Divide and ConquerDivide and Conquer · Binary Search · Tree · RecursionEasy
  86. Count Nodes Strictly Greater than X in a BSTDivide and Conquer · Tree · RecursionEasy
  87. Subtree of Another Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  88. Count Even-Valued Leaves in Binary TreeDivide and Conquer · Tree · RecursionEasy
  89. Univalued Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  90. Maximum Crossing Subarray Helper FunctionDivide and Conquer · ArrayEasy
  91. Leaf-Similar Trees via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  92. Diameter of Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
  93. Longest Nice Substring (Missing-Case Character Splitting)Divide and Conquer · Tree · Recursion · StringEasy
  94. Verify a Beautiful ArrayDivide and Conquer · ArrayEasy
  95. Upper Rank of a Target Across Two Sorted ArraysDivide and Conquer · Array · Sorting · Binary SearchEasy
  96. Maximum Subarray Sum via Divide and ConquerDivide and Conquer · ArrayMedium
  97. Find First and Last Position of Element in Sorted ArrayDivide and Conquer · Array · SortingMedium
  98. Count Complete Tree Nodes via Divide and ConquerDivide and Conquer · Tree · RecursionMedium
  99. Find Peak Element in ArrayDivide and Conquer · Array · Binary SearchMedium
  100. Quicksort Algorithm (Divide and Conquer Sorting)Divide and Conquer · Array · SortingMedium
  101. Equivalent Strings Under Recursive Halves SwappingDivide and Conquer · Array · StringMedium
  102. Count Inversions via Divide and Conquer (Merge Count)Divide and Conquer · Array · SortingMedium
  103. Search in Rotated Sorted Array (Target Existence Check)Divide and Conquer · Array · Sorting · Binary SearchMedium
  104. Combine Step: Merge Two Single-Building SkylinesDivide and Conquer · Array · Sorting · GeometryMedium
  105. Quickselect: K-th Smallest Element via Divide and ConquerDivide and Conquer · Array · SortingMedium
  106. Sort List (Linked List Merge Sort)Divide and Conquer · Array · SortingMedium
  107. Kth Largest Element in an Array (Quickselect)Divide and Conquer · Array · SortingMedium
  108. Different Ways to Add ParenthesesDivide and ConquerMedium
  109. Construct Binary Tree from Preorder and Inorder TraversalDivide and Conquer · Tree · RecursionMedium
  110. Search a 2D Matrix II (Quadrant Pruning Divide and Conquer)Divide and Conquer · MatrixMedium
  111. Construct Quad TreeDivide and Conquer · MatrixMedium
  112. Longest Substring with At Least K Repeating CharactersDivide and Conquer · Tree · Recursion · StringMedium
  113. Construct Binary Tree from Inorder and Postorder TraversalDivide and Conquer · Tree · RecursionMedium
  114. Convert Sorted Linked List to Height-Balanced BSTDivide and Conquer · Array · Sorting · Tree · RecursionMedium
  115. Beautiful Array GenerationDivide and Conquer · ArrayMedium
  116. Maximum Binary Tree (Cartesian Tree Divide and Conquer)Divide and Conquer · Tree · RecursionMedium
  117. Count Ordered Full Binary Tree ShapesDivide and Conquer · Tree · Recursion · Dynamic ProgrammingMedium
  118. Search in Rotated Sorted Array (Exact Index Lookup)Divide and Conquer · Array · Sorting · Binary SearchMedium
  119. Find Minimum in Rotated Sorted ArrayDivide and Conquer · Array · Sorting · Binary SearchMedium
  120. Super Pow (Large Exponent Modular Divide and Conquer)Divide and Conquer · MathMedium
  121. Find Duplicate Number via Value-Range Binary SearchDivide and Conquer · Binary SearchMedium
  122. K Closest Points to Origin (Quickselect)Divide and Conquer · Array · Sorting · GeometryMedium
  123. Top K Frequent Elements (Quickselect)Divide and Conquer · Array · SortingMedium
  124. Validate Binary Search Tree via Divide and ConquerDivide and Conquer · Binary Search · Tree · RecursionMedium
  125. Canonical Wiggle Sort via Divide and Conquer SortingDivide and Conquer · Array · SortingMedium
  126. Search in Rotated Sorted Array with DuplicatesDivide and Conquer · Array · Sorting · Binary SearchMedium
  127. Find a Peak Element in a 2D GridDivide and Conquer · Binary Search · MatrixMedium
  128. Majority Element II (Elements with Frequency > n/3)Divide and ConquerMedium
  129. Maximum Product Subarray via Divide and ConquerDivide and Conquer · Array · MathMedium
  130. Find K-th Element of Two Sorted ArraysDivide and Conquer · Array · Sorting · Binary SearchMedium
  131. Search in a Bitonic ArrayDivide and Conquer · Array · Binary SearchMedium
  132. Convert Binary Search Tree to Circular Doubly Linked ListDivide and Conquer · Binary Search · Tree · RecursionMedium
  133. Merge k Sorted ListsDivide and Conquer · Array · SortingMedium
  134. Count Finite Voronoi Vertices from a Convex HullDivide and Conquer · GeometryMedium
  135. Blelloch Parallel Scan (Tree-Based Up-Sweep and Down-Sweep Divide and Conquer)Divide and Conquer · Tree · Recursion · Prefix SumMedium
  136. Median of Two Sorted ArraysDivide and Conquer · Array · Sorting · Binary SearchHard
  137. The Skyline ProblemDivide and Conquer · GeometryHard
  138. Reverse Pairs (Merge Sort Augmented Count)Divide and Conquer · Array · SortingHard
  139. Closest Pair of Points in 2D PlaneDivide and Conquer · GeometryHard
  140. Count of Smaller Numbers After SelfDivide and ConquerHard
  141. Count of Range SumDivide and Conquer · Prefix SumHard
  142. Burst Balloons (Interval Divide and Conquer)Divide and Conquer · Dynamic ProgrammingHard
  143. Expression Add OperatorsDivide and Conquer · String · BacktrackingHard
  144. Strassen's Matrix MultiplicationDivide and Conquer · Matrix · MathHard
  145. Fast Fourier Transform (FFT) Polynomial MultiplicationDivide and Conquer · MathHard
  146. Simulated Ship Search with a Quadtree Oracle TraceDivide and Conquer · Matrix · GeometryHard
  147. Number of Digit OneDivide and Conquer · MathHard
  148. Create Maximum NumberDivide and ConquerHard
  149. Deterministic Linear-Time Selection (BFPRT / Median-of-Medians)Divide and Conquer · Array · SortingHard
  150. Karatsuba Large Integer MultiplicationDivide and Conquer · MathHard
  151. Maximum Gap via Pigeonhole BucketsDivide and Conquer · Array · SortingHard
  152. Super Egg Drop (Interval Bisection Divide and Conquer)Divide and Conquer · Binary SearchHard
  153. Centroid Decomposition of a Tree (Path Counting)Divide and Conquer · Tree · RecursionHard
  154. CDQ Divide and Conquer (3D Partial Order)Divide and Conquer · GraphHard
  155. Divide and Conquer DP Optimization (Quadrangle Inequality)Divide and Conquer · Dynamic ProgrammingHard
  156. Range Maximum Subarray Sum with Dynamic UpdatesDivide and Conquer · Array · Segment TreeHard
  157. Min-Plus Convolution with One Convex SequenceDivide and Conquer · MathHard
  158. Optimal Binary Search Tree (Knuth-Yao Interval Divide and Conquer)Divide and Conquer · Binary Search · Tree · Recursion · Dynamic ProgrammingHard
  159. Minimum Balanced Vertex Separator by Divide and ConquerDivide and Conquer · Graph · BacktrackingHard
  160. Offline Dynamic Convex Hull Trick (CDQ Divide and Conquer on Lines)Divide and Conquer · GeometryHard
  161. Canonical Ham-Sandwich Candidate Line by Divide and ConquerDivide and Conquer · Geometry · BacktrackingHard
  162. Convex Hull via Divide and Conquer (Preparata-Hong Algorithm)Divide and Conquer · GeometryVery hard
  163. Offline Dynamic Graph Connectivity (Timeline Divide and Conquer with Rollback DSU)Divide and Conquer · Graph · Union FindVery hard
  164. Polynomial Inverse via Newton's Method Divide and ConquerDivide and Conquer · MathVery hard
  165. Dynamic Distance Queries in a Tree (Centroid Tree Decomposition)Divide and Conquer · Tree · RecursionVery hard
  166. Aliens' Trick (WQS Lagrangian Bisection Divide and Conquer)Divide and Conquer · Binary Search · Dynamic ProgrammingVery hard
  167. Dynamic Tree Independent Set (DDP via Heavy-Light Divide and Conquer)Divide and Conquer · Tree · Recursion · Dynamic Programming · Segment TreeVery hard
  168. Fast Polynomial Multipoint Evaluation (Subproduct Tree Divide and Conquer)Divide and Conquer · MathVery hard
  169. Hopcroft's DFA Minimization (Smaller-Half Divide and Conquer)Divide and Conquer · GraphVery hard
  170. DC3 Suffix Array Construction (Difference Cover 3 Divide and Conquer)Divide and Conquer · Array · StringVery hard