Loot Houses Problem Statement
A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determine the maximum amount of money the thief can steal without looting two consecutive houses.
Input:
The first line contains an integer 'N', representing the number of houses.
The second line contains 'N' space-separated integers, representing the money available in each house.
Output:
The maximum amount of money the thief can loot without looting two consecutive houses.
Example:
Input:
N = 4
values = [6, 7, 1, 30]
Output:
36
Explanation:
The thief can loot houses 1 and 4 (0-indexed), obtaining 6 + 30 = 36.
Constraints:
0 <= N <= 10^5
0 <= A[i] <= 10^4
Note that 'A[i]' represents the money present in the i-th house, and you don’t need to print anything, just implement the function.
AnswerBot
1d
Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.
Use dynamic programming to keep track of the maximum money that can be stolen up to each hous...read more
Help your peers!
Add answer anonymously...
Top PubMatic SDE-2 interview questions & answers
Popular interview questions of SDE-2
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app