NeetCode #279LC-2560MediumBinary Search
← Back to All Problems#279 · #2560 · House Robber IV(打家劫舍 IV)
📌 Problem Statement & Constraints
You are given an integer array
nums and an integer k. You must rob at least k houses; adjacent houses cannot both be robbed. The capability is the maximum amount robbed from any single house. Return the minimum possible capability. Constraints: 1 <= nums.length <= 10^5, 1 <= nums[i] <= 10^9, 1 <= k <= (nums.length + 1) / 2.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!