Nishant G.

This is a coding question. However, I do not require the answer in code. I just need help in figuring out the math behind this question.

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

NOTE: The "list" is actually an array of integers where the index of element means the position of the house and the element is the amount of money stashed in it. Robber cant rob adjacent indices. As a sample, the array is as follows

[10 50 7 15 500 100]

By:

Nishant G.

Ah, herein lies the issue. The correct answer in this case would be simply adding the elements 500 and 50 to get 550. That is what has got me stumped. Thank you for ur help.
Report

05/10/17

Still looking for help? Get the right answer, fast.

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.