-
Notifications
You must be signed in to change notification settings - Fork 19.2k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[FEATURE REQUEST] Add Maximum Sum of Non-Adjacent Elements Algorithm #5510
Labels
Comments
Sure, go ahead and add it |
Thank you! I'll start working on it. |
6 tasks
Please assign the task to me as a hacktoberfest contributor |
Is task still open? if yes please assign the task to me as a hacktoberfest contributor |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
What would you like to Propose?
I would like to propose adding an implementation of the Maximum Sum of Non-Adjacent Elements algorithm to the dynamic programming section of the repository.
Issue details
Problem Statement:
Given an array of integers, write a function to find the maximum sum of non-adjacent elements. The elements can be chosen such that no two chosen elements are adjacent in the array.
For example:
Input: [3, 2, 5, 10, 7]
Output: 15 (The maximum sum is obtained by selecting 3, 7, and 5)
Approach:
Additional Information
No response
The text was updated successfully, but these errors were encountered: