Practice problems across 75+ categories
Practice problems frequently asked at Divide and Conquer • 50 problems | 7 Easy | 26 Medium | 17 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1 | Balance a Binary Search Tree | Medium | Divide and ConquerGreedyTree |
| 2 | Beautiful Array | Medium | ArrayMathDivide and Conquer |
| 3 | Beautiful Pairs | Hard | ArrayMathDivide and Conquer |
| 4 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 5 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 6 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 7 | Construct Quad Tree | Medium | ArrayDivide and ConquerTree |
| 8 | Convert Sorted Array to Binary Search Tree | Easy | ArrayDivide and ConquerTree |
| 9 | Convert Sorted List to Binary Search Tree | Medium | Linked ListDivide and ConquerTree |
| 10 | Count Good Triplets in an Array | Hard | ArrayBinary SearchDivide and Conquer |
| 11 | Count Nodes That Are Great Enough | Hard | Divide and ConquerTreeDepth-First Search |
| 12 | Count of Range Sum | Hard | ArrayBinary SearchDivide and Conquer |
| 13 | Count of Smaller Numbers After Self | Hard | ArrayBinary SearchDivide and Conquer |
| 14 | Count Subarrays With More Ones Than Zeros | Medium | ArrayHash TableBinary Search |
| 15 | Count the Number of K-Big Indices | Hard | ArrayBinary SearchDivide and Conquer |
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.
