|
| 1 | + |
| 2 | + |
| 3 | +| Problem | Difficulty Level | Problem Link | |
| 4 | +|-----------------------------------------------------------|------------------|------------------------------------------------------------| |
| 5 | +| [Find square root of a number in log n](https://www.geeksforgeeks.org/square-root-of-an-integer/) | Medium | [Problem Link](https://practice.geeksforgeeks.org/problems/square-root-of-a-number/0) | |
| 6 | +| [Find the Nth root of a number using binary search](https://www.geeksforgeeks.org/n-th-root-number-using-logarithm/) | Medium | [Problem Link](https://practice.geeksforgeeks.org/problems/nth-root-of-m/0) | |
| 7 | +| [Koko Eating Bananas](https://www.geeksforgeeks.org/koko-eating-bananas/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/koko-eating-bananas/1) | |
| 8 | +| [Minimum days to make M bouquets](https://www.geeksforgeeks.org/minimum-days-to-make-m-bouquets/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/minimum-days-to-make-m-bouquets/1) | |
| 9 | +| [Find the smallest Divisor](https://www.geeksforgeeks.org/find-the-smallest-divisor-given-a-threshold/) | Easy | [Problem Link](https://practice.geeksforgeeks.org/problems/smallest-divisor/1) | |
| 10 | +| [Capacity to Ship Packages within D Days](https://www.geeksforgeeks.org/capacity-to-ship-packages-within-d-days/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/capacity-to-ship-packages-within-d-days/1) | |
| 11 | +| [Kth Missing Positive Number](https://www.geeksforgeeks.org/kth-missing-positive-number/) | Easy | [Problem Link](https://practice.geeksforgeeks.org/problems/kth-missing-positive-number/1) | |
| 12 | +| [Aggressive Cows](https://www.geeksforgeeks.org/aggressive-cows-problem/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/aggressive-cows/0) | |
| 13 | +| [Book Allocation Problem](https://www.geeksforgeeks.org/allocate-minimum-number-pages/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0) | |
| 14 | +| [Split array - Largest Sum](https://www.geeksforgeeks.org/split-array-largest-sum/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/split-array-largest-sum/1) | |
| 15 | +| [Painter's partition](https://www.geeksforgeeks.org/painters-partition-problem/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/the-painters-partition-problem/0) | |
| 16 | +| [Minimize Max Distance to Gas Station](https://www.geeksforgeeks.org/minimize-max-distance-to-gas-station/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/minimize-max-distance-to-gas-station/1) | |
| 17 | +| [Median of 2 sorted arrays](https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/) | Hard | [Problem Link](https://practice.geeksforgeeks.org/problems/median-of-2-sorted-arrays-of-different-sizes/1) | |
| 18 | +| [Kth element of 2 sorted arrays](https://www.geeksforgeeks.org/k-th-element-two-sorted-arrays/) | Medium | [Problem Link](https://practice.geeksforgeeks.org/problems/k-th-element-of-two-sorted-arrays/0) | |
| 19 | + |
| 20 | + |
| 21 | +This table includes the problem name with a link to its article on GeeksforGeeks, the difficulty level, and a link to the problem itself on GeeksforGeeks. |
0 commit comments