|
133 | 133 | 8. Bitonic Array Maximum (easy) [Geeksforgeeks](https://www.geeksforgeeks.org/find-the-maximum-element-in-an-array-which-is-first-increasing-and-then-decreasing/) |
134 | 134 | 9. Problem Challenge 1 - Search Bitonic Array (medium) [Leetcode](https://leetcode.com/problems/find-in-mountain-array/) |
135 | 135 | 10. Problem Challenge 2 - Search in Rotated Array (medium) [Leetcode](https://leetcode.com/problems/search-in-rotated-sorted-array/) |
136 | | -11. Problem Challenge 3 - Rotation Count (medium) [Geeksforgeeks](https://www.geeksforgeeks.org/find-rotation-count-rotated-sorted-array/) |
| 136 | +11. Problem Challenge 3 - Rotation Count (medium) [Geeksforgeeks](https://www.geeksforgeeks.org/find-rotation-count-rotated-sorted-array/) |
| 137 | +12. *Minimum Number of Days to Make m Bouquets (medium) [Leetcode](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/) |
| 138 | +13. *Koko Eating Bananas (medium) [Leetcode](https://leetcode.com/problems/koko-eating-bananas/) |
| 139 | +14. *Capacity To Ship Packages Within D Days (medium) [Leetcode](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) |
| 140 | +15. *Median of Two Sorted Arrays (hard) [Leetcode](https://leetcode.com/problems/median-of-two-sorted-arrays/) |
137 | 141 |
|
138 | 142 | ### 12. Pattern: Bitwise XOR |
139 | 143 |
|
|
0 commit comments