Add Maximum Sum of Non-Adjacent Elements Algorithm

Author: HemanthTigga

src/main/java/com/thealgorithms/dynamicprogramming/MaxSumNonAdjacent.java

@@ -2,6 +2,18 @@
 
 import java.util.*;
 
+/*
+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:
+Use dynamic programming to maintain a running maximum sum.
+For each element, decide to either include it in the sum (and skip the previous element) or exclude
+it (and keep the sum up to the previous element).*/
 // Problem explanation:
 // "https://medium.com/@amitrajit_bose/max-sum-of-non-adjacent-elements-a04ebc4f2602"
 
@@ -57,10 +69,10 @@ public static void main(String[] args) {
         for (int i = 0; i < n; i++) { nums[i] = sc.nextInt(); }
 
         // Call the solve function to find the maximum possible sum.
-        int result = solve(n, nums);
+        int ans = solve(n, nums);
 
         // Print the result.
-        System.out.println("Maximum sum of non-adjacent elements: " + result);
+        System.out.println("Maximum sum of non-adjacent elements: " + ans);
 
         sc.close(); // Close the scanner to prevent resource leakage.
     }