Added House-robber Problem to Dynamic Programming

[T-Fathima]

📥 Pull Request

Description

In this pull request, I have added the implementation and explanation of the House Robber problem. This is a classic dynamic programming challenge that determines the maximum amount of money you can rob from a series of houses arranged in a line, with the constraint that you cannot rob two adjacent houses. The implementation includes the dynamic programming approach and test cases to demonstrate its functionality.

Fixes #1352

Type of change

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• Documentation update

Checklist:

• My code follows the style guidelines of this project
• I have performed a self-review of my code
• I have commented my code, particularly in hard-to-understand areas
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Any dependent changes have been merged and published in downstream modules

@ajay-dhangar Please review and merge my code under gssoc-ext and hacktoberfest.
Thank you.

[github-actions]

🎉 Great job, @T-Fathima! Thank you for submitting your pull request. We appreciate your contribution, and our team will review it shortly.

[github-actions]

⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀

🔗 Site: Algo | Live Site

URL 🌐	Performance	Accessibility	Best Practices	SEO	📊
/algo/	🟡 52	🟡 87	🟡 75	🟡 71	📄
/algo/docs	🔴 46	🟢 96	🟡 75	🟢 100	📄
/algo/blog	🟡 68	🟢 92	🟢 96	🟡 86	📄

[ajay-dhangar]

Done