Mar 15

Author: siddydutta

2025-03-March-LeetCoding-Challenge/House Robber IV.py

@@ -0,0 +1,32 @@
+class Solution:
+    def minCapability(self, nums: list[int], k: int) -> int:
+        left, right = 1, max(nums)
+        while left < right:
+            mid = (left + right) // 2
+            capability = 0
+            idx = 0
+            while idx < len(nums):
+                if nums[idx] <= mid:
+                    capability += 1
+                    idx += 2
+                else:
+                    idx += 1
+            if capability >= k:
+                right = mid
+            else:
+                left = mid + 1
+        return left
+
+
+def main():
+    nums = [2, 3, 5, 9]
+    k = 2
+    assert Solution().minCapability(nums, k) == 5
+
+    nums = [2, 7, 9, 3, 1]
+    k = 2
+    assert Solution().minCapability(nums, k) == 2
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -18,7 +18,7 @@
 | March 12 | [2529. Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/) | Easy | Solved |
 | March 13 | [https://leetcode.com/problems/zero-array-transformation-ii/](https://leetcode.com/problems/zero-array-transformation-ii/) | Medium | Unsolved |
 | March 14 | [2226. Maximum Candies Allocated to K Children](https://leetcode.com/problems/maximum-candies-allocated-to-k-children/) | Medium | Solved |
-| March 15 | []() |  |  |
+| March 15 | [2560. House Robber IV](https://leetcode.com/problems/house-robber-iv/) | Medium | Unsolved |
 | March 16 | []() |  |  |
 | March 17 | []() |  |  |
 | March 18 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 9 | 5 | 4 |
+| Medium | 10 | 5 | 5 |
 | Hard   | 0 | 0 | 0 |