Due: April 5, 11:55 pm

Group 1 | Flynn, Boning |

Group 2 | John, Kyle |

Group 3 | Charlie, Preston |

Group 4 | Thomas, Issac |

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.

You are to use **dynamic programming** for this solution.

You are to find a **dynamic programming** solution to this problem, and implement it on Leetcode.

Then you will do a runtime analysis of your solution.

Turn in:

- Source code for your solution
- Samples runs showing the operation with input and outputs.
- A complete asymptotic analysis.
- An explaination of how this using the principle of optimality

Be prepared to discuss you solutions in class.

This topic: Main > WebHome > Math391F2016 > LeetCode6

Topic revision: r6 - 2019-03-24 - JimSkon

Copyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.

Ideas, requests, problems regarding TWiki? Send feedback

Ideas, requests, problems regarding TWiki? Send feedback