Grokking Coding Mock Interview
Ask Author
Back to course home

0% completed

Solution: House Robber IV
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

You are given a list of houses arranged in a row, where each house contains a certain amount of money. A robber plans to steal from at least k houses, but he cannot rob two houses that are next to each other.

Each time the robber robs a house, he notes how much money he got from it. His capability is defined as the highest amount he takes from any single house during the robbery.

You are given an integer array nums, where nums[i] is the amount of money in the i-th house. You are also given an integer k, which is the minimum number of houses the robber must rob.

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible