Practice problems across 75+ categories
Practice problems frequently asked at Divide and Conquer • 50 problems | 7 Easy | 26 Medium | 17 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 31 | Maximum Subarray | Medium | ArrayDivide and ConquerDynamic Programming |
| 32 | Maximum Sum Circular Subarray | Medium | ArrayDivide and ConquerDynamic Programming |
| 33 | Maximum Sum of Subsequence With Non-adjacent Elements | Hard | ArrayDivide and ConquerDynamic Programming |
| 34 | Median of Two Sorted Arrays | Hard | ArrayBinary SearchDivide and Conquer |
| 35 | Merge k Sorted Lists | Hard | Linked ListDivide and ConquerHeap (Priority Queue) |
| 36 | Number of 1 Bits | Easy | Divide and ConquerBit Manipulation |
| 37 | Number of Pairs Satisfying Inequality | Hard | ArrayBinary SearchDivide and Conquer |
| 38 | Number of Ships in a Rectangle | Hard | ArrayDivide and ConquerInteractive |
| 39 | Number of Ways to Reorder Array to Get Same BST | Hard | ArrayMathDivide and Conquer |
| 40 | Query Kth Smallest Trimmed Number | Medium | ArrayStringDivide and Conquer |
| 41 | Range Sum Query - Mutable | Easy | ArrayDivide and ConquerDesign |
| 42 | Reverse Bits | Easy | Divide and ConquerBit Manipulation |
| 43 | Reverse Pairs | Hard | ArrayBinary SearchDivide and Conquer |
| 44 | Search a 2D Matrix II | Medium | ArrayBinary SearchDivide and Conquer |
| 45 | Sort an Array | Medium | ArrayDivide and ConquerSorting |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
