PR for adding new DP Problem Statement to calculateMaxNonAdjacentSum of 2D Array

[swarnim0308]

• [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
• [x] Code is formatted by basic Intellij Idea Java format.

[swarnim0308]

I am not able to run clang-format -i --style=file path/to/your/file.java. Getting below clang-format : The term 'clang-format' is not recognized as the name of a cmdlet, function, script file, or operable program. Check the spelling of the name, or if a path was included, verify that the path is correct and try again. At line:1 char:1

• clang-format -i --style=file MaximumSumWithoutAdjacent.java

•   + CategoryInfo          : ObjectNotFound: (clang-format:String) [], CommandNotFoundException
    + FullyQualifiedErrorId : CommandNotFoundException
  
  

[swarnim0308]

clang format issue fixed. Put for review now.

[swarnim0308]

Can you please do the review

[siriak]

We do not add problems just from Leetcode/geeksforgeeks. If there are other sources for it like Wikipedia, please add a link to them

[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!