House Robber IV

Given an integer array nums, where nums[i] is the amount of money in the i-th house, and an integer k.

Choose at least k houses such that no two chosen houses are adjacent. The **capability...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: