Open saptarshisarkar20 opened 1 year ago
hey @saptarshisarkar20 i have created a pull request for this issue, kindly review and approve it
@saptarshisarkar20 please assign me this issue
Please assign me this issue
@saptarshisarkar20 can you please assign me this issue I would provide an optimal solution for this issue :)
I wish to contribute. Kindly assign me this issue.
@saptarshisarkar20 Can I contribute to #71 issue
Hey @saptarshisarkar20 can u please assign this issue to me. I am keen to solve this problem
I wish to contribute. Kindly assign this task to me.
Hello, Can you please assign me this issue?
Hey @saptarshisarkar20 ,I am eager to submit a well-structured, optimized solution for the House Robber problem. My code follows industry best practices and is accompanied by detailed explanations for clarity. Kindly consider accepting this valuable addition to your repository.Please Assign Me To This.
can you pls assign to me??
What to Do?
Star ๐ the repo Fork ๐ฟ the repo Location Go to folder Pull Here/LeetCode/HouseRobber
File name Take your GitHub username id like "hrithik339", "hacker-boy", etc or anything which you have. Then add a programming language extension after this (link for C++ add .cpp and for python add.py) Only files with the correct file name will be accepted
Problem Statement
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 systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.
Example 1:
Input: nums = [1,2,3,1] Output: 4
Example 2:
Input: nums = [2,7,9,3,1] Output: 12
Constraints:
1 <= nums.length <= 100 0 <= nums[i] <= 400
Function