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
- Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
- Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
- 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 totalOpen a question in the editor to read its statement and examples. Sign in to practice.
- Split Array into Left and Right HalvesDivide and Conquer · ArrayBasic
- Sum of Array via Divide and ConquerDivide and Conquer · ArrayBasic
- Maximum Element via Divide and ConquerDivide and ConquerBasic
- Minimum Element via Divide and ConquerDivide and ConquerBasic
- Count Occurrences of Target via Divide and ConquerDivide and ConquerBasic
- Product of Array Elements via Divide and ConquerDivide and Conquer · Array · MathBasic
- Count Even Numbers via Divide and ConquerDivide and ConquerBasic
- Check if All Elements are PositiveDivide and ConquerBasic
- Simultaneous Minimum and Maximum via Divide and ConquerDivide and ConquerBasic
- Combine Step: Merge Two Sorted HalvesDivide and Conquer · Array · SortingBasic
- Array Length via Divide and ConquerDivide and Conquer · ArrayBasic
- Integer Power via Binary Exponentiation (Divide and Conquer)Divide and Conquer · MathBasic
- Count Target Character in String via Divide and ConquerDivide and Conquer · StringBasic
- Check if Two Halves of Array are IdenticalDivide and Conquer · ArrayBasic
- Compare Maximums of Left and Right HalvesDivide and Conquer · ArrayBasic
- Count Vowels in String via Divide and ConquerDivide and Conquer · StringBasic
- Reverse Array by Swapping Halves (Recursive Reversal)Divide and Conquer · ArrayBasic
- Both Halves Strictly Increasing CheckDivide and Conquer · ArrayBasic
- Binary Search Base Decision (Single Division Step)Divide and Conquer · Binary SearchBasic
- Element-wise Sum of Two HalvesDivide and Conquer · ArrayBasic
- Number of Division Levels to Reach Base CaseDivide and ConquerBasic
- Count Total Base Cases (Leaves) in Division TreeDivide and Conquer · Tree · RecursionBasic
- Absolute Difference Between Sum of Left and Right HalvesDivide and Conquer · ArrayBasic
- Count Negative Numbers via Divide and ConquerDivide and ConquerBasic
- Combine Step: Alternating Interleave of Two HalvesDivide and Conquer · ArrayBasic
- Count Zeros via Divide and ConquerDivide and ConquerBasic
- Cross-Half Spread: Max of Right Minus Min of LeftDivide and ConquerBasic
- Check if String is Palindrome via HalvesDivide and Conquer · Array · StringBasic
- Count Total Division Steps in Recursion TreeDivide and Conquer · Tree · RecursionBasic
- Combine Step: Merge Ascending Halves into Descending ArrayDivide and Conquer · Array · SortingBasic
- Count Elements Exceeding Threshold via Divide and ConquerDivide and ConquerBasic
- Divide and Conquer Search: Binary Search IndexDivide and Conquer · Binary SearchBasic
- Verify Array is Sorted via Divide and ConquerDivide and Conquer · Array · SortingBasic
- First Occurrence in Left Half Before Right HalfDivide and ConquerBasic
- Combine Step: Merge Two Unsorted Halves After Independent SortingDivide and Conquer · Array · SortingBasic
- Count Odd Numbers via Divide and ConquerDivide and ConquerBasic
- Boundary Crossing Pair SumDivide and ConquerBasic
- Divide String into Four QuartersDivide and Conquer · StringBasic
- Boolean Target Existence Search via Divide and ConquerDivide and ConquerBasic
- Combine Step: Merge Two Sorted Arrays with Duplicate EliminationDivide and Conquer · Array · SortingBasic
- Average of Array Elements via Divide and ConquerDivide and Conquer · Array · MathBasic
- Base Inversion Check (Pair of Elements)Divide and ConquerBasic
- Power-of-Two Array Size Check for Perfect HalvingDivide and Conquer · Array · MathBasic
- Count Upper and Lower Case Letters via Divide and ConquerDivide and ConquerBasic
- Combine Step: Merge and Count ComparisonsDivide and Conquer · Array · SortingBasic
- Left-Heavy vs Right-Heavy Array Sum ComparisonDivide and Conquer · ArrayBasic
- Maximum Subarray Sum of Length at Most 2 via Divide and ConquerDivide and Conquer · ArrayBasic
- Invert Array Signs via Divide and ConquerDivide and Conquer · ArrayBasic
- Compare Minimums of Left and Right HalvesDivide and Conquer · ArrayBasic
- Quicksort Divide Invariant Check (Partition Verification)Divide and Conquer · Array · SortingBasic
- Karatsuba Multiplication Base Step (Two-Digit Splitting)Divide and Conquer · MathBasic
- Quadtree Quadrant Splitting and Sign InversionDivide and Conquer · MatrixBasic
- Count Occupied Points in Four Quadtree QuadrantsDivide and Conquer · MatrixBasic
- Defective Chessboard Tiling with L-TrominoesDivide and ConquerBasic
- Merge Sort AlgorithmDivide and Conquer · Array · SortingEasy
- Majority Element via Divide and ConquerDivide and ConquerEasy
- Pow(x, n) with Exact Four-Decimal RoundingDivide and Conquer · MathEasy
- Search Insert PositionDivide and Conquer · Binary SearchEasy
- Convert Sorted Array to Height-Balanced BSTDivide and Conquer · Array · Sorting · Tree · RecursionEasy
- Maximum Depth of Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Invert Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Peak Index in a Mountain ArrayDivide and Conquer · Array · Binary SearchEasy
- Longest Common Prefix via Divide and ConquerDivide and Conquer · StringEasy
- Merge Two Binary Trees via Divide and ConquerDivide and Conquer · Array · Sorting · Tree · RecursionEasy
- Minimum Depth of Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- First Bad Version: Deterministic Binary Search TraceDivide and Conquer · Binary SearchEasy
- Search a 2D Matrix (Flattened Divide and Conquer)Divide and Conquer · MatrixEasy
- Guess Number: Deterministic Bisection TraceDivide and Conquer · Binary SearchEasy
- Symmetric Tree via Divide and Conquer (Mirror Check)Divide and Conquer · Tree · RecursionEasy
- Balanced Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Integer Square Root via Divide and ConquerDivide and Conquer · Binary SearchEasy
- Quicksort Divide Step: Lomuto Partition SchemeDivide and Conquer · Array · SortingEasy
- Same Tree Check via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Count Elements Less Than or Equal to Target (Upper Bound Search)Divide and Conquer · Binary SearchEasy
- Number of 1 Bits (Divide and Conquer Bit Folding)Divide and Conquer · Bit ManipulationEasy
- Reverse Bits via Divide and ConquerDivide and Conquer · Bit ManipulationEasy
- Range Sum of BST via Divide and ConquerDivide and Conquer · Tree · Recursion · Prefix SumEasy
- Valid Perfect Square via Divide and ConquerDivide and Conquer · Binary SearchEasy
- Inorder Traversal via Divide and ConquerDivide and ConquerEasy
- Preorder Traversal via Divide and ConquerDivide and ConquerEasy
- Postorder Traversal via Divide and ConquerDivide and ConquerEasy
- Strassen’s Matrix Multiplication Base Step (2x2 Product)Divide and Conquer · Matrix · MathEasy
- Sum of Leaf Nodes in Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Maximum Value in a Binary Search Tree via Divide and ConquerDivide and Conquer · Binary Search · Tree · RecursionEasy
- Minimum Value in a Binary Search Tree via Divide and ConquerDivide and Conquer · Binary Search · Tree · RecursionEasy
- Count Nodes Strictly Greater than X in a BSTDivide and Conquer · Tree · RecursionEasy
- Subtree of Another Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Count Even-Valued Leaves in Binary TreeDivide and Conquer · Tree · RecursionEasy
- Univalued Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Maximum Crossing Subarray Helper FunctionDivide and Conquer · ArrayEasy
- Leaf-Similar Trees via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Diameter of Binary Tree via Divide and ConquerDivide and Conquer · Tree · RecursionEasy
- Longest Nice Substring (Missing-Case Character Splitting)Divide and Conquer · Tree · Recursion · StringEasy
- Verify a Beautiful ArrayDivide and Conquer · ArrayEasy
- Upper Rank of a Target Across Two Sorted ArraysDivide and Conquer · Array · Sorting · Binary SearchEasy
- Maximum Subarray Sum via Divide and ConquerDivide and Conquer · ArrayMedium
- Find First and Last Position of Element in Sorted ArrayDivide and Conquer · Array · SortingMedium
- Count Complete Tree Nodes via Divide and ConquerDivide and Conquer · Tree · RecursionMedium
- Find Peak Element in ArrayDivide and Conquer · Array · Binary SearchMedium
- Quicksort Algorithm (Divide and Conquer Sorting)Divide and Conquer · Array · SortingMedium
- Equivalent Strings Under Recursive Halves SwappingDivide and Conquer · Array · StringMedium
- Count Inversions via Divide and Conquer (Merge Count)Divide and Conquer · Array · SortingMedium
- Search in Rotated Sorted Array (Target Existence Check)Divide and Conquer · Array · Sorting · Binary SearchMedium
- Combine Step: Merge Two Single-Building SkylinesDivide and Conquer · Array · Sorting · GeometryMedium
- Quickselect: K-th Smallest Element via Divide and ConquerDivide and Conquer · Array · SortingMedium
- Sort List (Linked List Merge Sort)Divide and Conquer · Array · SortingMedium
- Kth Largest Element in an Array (Quickselect)Divide and Conquer · Array · SortingMedium
- Different Ways to Add ParenthesesDivide and ConquerMedium
- Construct Binary Tree from Preorder and Inorder TraversalDivide and Conquer · Tree · RecursionMedium
- Search a 2D Matrix II (Quadrant Pruning Divide and Conquer)Divide and Conquer · MatrixMedium
- Construct Quad TreeDivide and Conquer · MatrixMedium
- Longest Substring with At Least K Repeating CharactersDivide and Conquer · Tree · Recursion · StringMedium
- Construct Binary Tree from Inorder and Postorder TraversalDivide and Conquer · Tree · RecursionMedium
- Convert Sorted Linked List to Height-Balanced BSTDivide and Conquer · Array · Sorting · Tree · RecursionMedium
- Beautiful Array GenerationDivide and Conquer · ArrayMedium
- Maximum Binary Tree (Cartesian Tree Divide and Conquer)Divide and Conquer · Tree · RecursionMedium
- Count Ordered Full Binary Tree ShapesDivide and Conquer · Tree · Recursion · Dynamic ProgrammingMedium
- Search in Rotated Sorted Array (Exact Index Lookup)Divide and Conquer · Array · Sorting · Binary SearchMedium
- Find Minimum in Rotated Sorted ArrayDivide and Conquer · Array · Sorting · Binary SearchMedium
- Super Pow (Large Exponent Modular Divide and Conquer)Divide and Conquer · MathMedium
- Find Duplicate Number via Value-Range Binary SearchDivide and Conquer · Binary SearchMedium
- K Closest Points to Origin (Quickselect)Divide and Conquer · Array · Sorting · GeometryMedium
- Top K Frequent Elements (Quickselect)Divide and Conquer · Array · SortingMedium
- Validate Binary Search Tree via Divide and ConquerDivide and Conquer · Binary Search · Tree · RecursionMedium
- Canonical Wiggle Sort via Divide and Conquer SortingDivide and Conquer · Array · SortingMedium
- Search in Rotated Sorted Array with DuplicatesDivide and Conquer · Array · Sorting · Binary SearchMedium
- Find a Peak Element in a 2D GridDivide and Conquer · Binary Search · MatrixMedium
- Majority Element II (Elements with Frequency > n/3)Divide and ConquerMedium
- Maximum Product Subarray via Divide and ConquerDivide and Conquer · Array · MathMedium
- Find K-th Element of Two Sorted ArraysDivide and Conquer · Array · Sorting · Binary SearchMedium
- Search in a Bitonic ArrayDivide and Conquer · Array · Binary SearchMedium
- Convert Binary Search Tree to Circular Doubly Linked ListDivide and Conquer · Binary Search · Tree · RecursionMedium
- Merge k Sorted ListsDivide and Conquer · Array · SortingMedium
- Count Finite Voronoi Vertices from a Convex HullDivide and Conquer · GeometryMedium
- Blelloch Parallel Scan (Tree-Based Up-Sweep and Down-Sweep Divide and Conquer)Divide and Conquer · Tree · Recursion · Prefix SumMedium
- Median of Two Sorted ArraysDivide and Conquer · Array · Sorting · Binary SearchHard
- The Skyline ProblemDivide and Conquer · GeometryHard
- Reverse Pairs (Merge Sort Augmented Count)Divide and Conquer · Array · SortingHard
- Closest Pair of Points in 2D PlaneDivide and Conquer · GeometryHard
- Count of Smaller Numbers After SelfDivide and ConquerHard
- Count of Range SumDivide and Conquer · Prefix SumHard
- Burst Balloons (Interval Divide and Conquer)Divide and Conquer · Dynamic ProgrammingHard
- Expression Add OperatorsDivide and Conquer · String · BacktrackingHard
- Strassen's Matrix MultiplicationDivide and Conquer · Matrix · MathHard
- Fast Fourier Transform (FFT) Polynomial MultiplicationDivide and Conquer · MathHard
- Simulated Ship Search with a Quadtree Oracle TraceDivide and Conquer · Matrix · GeometryHard
- Number of Digit OneDivide and Conquer · MathHard
- Create Maximum NumberDivide and ConquerHard
- Deterministic Linear-Time Selection (BFPRT / Median-of-Medians)Divide and Conquer · Array · SortingHard
- Karatsuba Large Integer MultiplicationDivide and Conquer · MathHard
- Maximum Gap via Pigeonhole BucketsDivide and Conquer · Array · SortingHard
- Super Egg Drop (Interval Bisection Divide and Conquer)Divide and Conquer · Binary SearchHard
- Centroid Decomposition of a Tree (Path Counting)Divide and Conquer · Tree · RecursionHard
- CDQ Divide and Conquer (3D Partial Order)Divide and Conquer · GraphHard
- Divide and Conquer DP Optimization (Quadrangle Inequality)Divide and Conquer · Dynamic ProgrammingHard
- Range Maximum Subarray Sum with Dynamic UpdatesDivide and Conquer · Array · Segment TreeHard
- Min-Plus Convolution with One Convex SequenceDivide and Conquer · MathHard
- Optimal Binary Search Tree (Knuth-Yao Interval Divide and Conquer)Divide and Conquer · Binary Search · Tree · Recursion · Dynamic ProgrammingHard
- Minimum Balanced Vertex Separator by Divide and ConquerDivide and Conquer · Graph · BacktrackingHard
- Offline Dynamic Convex Hull Trick (CDQ Divide and Conquer on Lines)Divide and Conquer · GeometryHard
- Canonical Ham-Sandwich Candidate Line by Divide and ConquerDivide and Conquer · Geometry · BacktrackingHard
- Convex Hull via Divide and Conquer (Preparata-Hong Algorithm)Divide and Conquer · GeometryVery hard
- Offline Dynamic Graph Connectivity (Timeline Divide and Conquer with Rollback DSU)Divide and Conquer · Graph · Union FindVery hard
- Polynomial Inverse via Newton's Method Divide and ConquerDivide and Conquer · MathVery hard
- Dynamic Distance Queries in a Tree (Centroid Tree Decomposition)Divide and Conquer · Tree · RecursionVery hard
- Aliens' Trick (WQS Lagrangian Bisection Divide and Conquer)Divide and Conquer · Binary Search · Dynamic ProgrammingVery hard
- Dynamic Tree Independent Set (DDP via Heavy-Light Divide and Conquer)Divide and Conquer · Tree · Recursion · Dynamic Programming · Segment TreeVery hard
- Fast Polynomial Multipoint Evaluation (Subproduct Tree Divide and Conquer)Divide and Conquer · MathVery hard
- Hopcroft's DFA Minimization (Smaller-Half Divide and Conquer)Divide and Conquer · GraphVery hard
- DC3 Suffix Array Construction (Difference Cover 3 Divide and Conquer)Divide and Conquer · Array · StringVery hard