House Robber IV Python Solution with Tests

lcpy gen -n 2560   # by problem number
lcpy gen -s house_robber_iv   # by problem name

Input: nums = [2,3,5,9], k = 2
Output: 5

Input: nums = [2,7,9,3,1], k = 2
Output: 2

class Solution:
    # Time: O(n log m) where m = max(nums)
    # Space: O(1)
    def min_capability(self, nums: list[int], k: int) -> int:
        def can_steal(cap: int) -> bool:
            count = 0
            i = 0
            while i < len(nums):
                if nums[i] <= cap:
                    count += 1
                    i += 2
                else:
                    i += 1
            return count >= k

        lo, hi = min(nums), max(nums)
        while lo < hi:
            mid = (lo + hi) // 2
            if can_steal(mid):
                hi = mid
            else:
                lo = mid + 1
        return lo