Feature/max sum non adjacent

[HemanthTigga]

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized it.
• [x] All filenames are in PascalCase.
• [x] All functions and variable names follow Java naming conventions.
• [x] All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• [x] All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

Attention: Patch coverage is 23.52941% with 13 lines in your changes missing coverage. Please review.

Project coverage is 52.23%. Comparing base (7f60d57) to head (a40d9c4). Report is 1 commits behind head on master.

Files with missing lines	Patch %	Lines
...gorithms/dynamicprogramming/MaxSumNonAdjacent.java	0.00%	13 Missing :warning:

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #5515      +/-   ##
============================================
- Coverage     52.28%   52.23%   -0.06%     
- Complexity     3256     3257       +1     
============================================
  Files           525      526       +1     
  Lines         15185    15194       +9     
  Branches       2887     2890       +3     
============================================
- Hits           7940     7937       -3     
- Misses         6920     6933      +13     
+ Partials        325      324       -1     

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.

[github-actions[bot]]

This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!

[github-actions[bot]]

Please reopen this pull request once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!