Divide and Conquer Topic Wise Problem-Solving Questions
1. Basic Divide and Conquer Concepts
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Find maximum and minimum in an array | Easy | - | Link |
| 2 | Power function implementation | Easy | - | Link |
| 3 | Find Peak Element | Medium | Link | Link |
| 4 | Majority Element | Medium | Link | Link |
2. Sorting Algorithms
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Merge Sort Implementation | Medium | - | Link |
| 2 | Quick Sort Implementation | Medium | - | Link |
| 3 | Count Inversions | Hard | Link | Link |
3. Searching Problems
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Binary Search Implementation | Easy | - | Link |
| 2 | Search in Rotated Sorted Array | Medium | Link | Link |
| 3 | Find First and Last Position in Sorted Array | Medium | Link | Link |
Related Divide and Conquer Resources