Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2560. House Robber IV
Select at least k non-adjacent houses so as to minimize the maximum value stolen from any chosen house — equivalently, find the smallest threshold T such that you can pick ≥k elements ≤T with no two adjacent. This is a feasibility-search problem (check if a candidate T allows ≥k picks under the non‑adjacency constraint) over the value range.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.