formatted using LLVM clang-formatter

Author: Guhapriya01

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

@@ -7,7 +7,8 @@
  * https://takeuforward.org/data-structure/maximum-sum-of-non-adjacent-elements-dp-5/
  */
 final class MaximumSumOfNonAdjacentElements {
-  private MaximumSumOfNonAdjacentElements() {}
+private
+  MaximumSumOfNonAdjacentElements() {}
 
   /**
    * Approach 1: Uses a dynamic programming array to store the maximum sum at
@@ -16,7 +17,8 @@ private MaximumSumOfNonAdjacentElements() {}
    * @param arr The input array of integers.
    * @return The maximum sum of non-adjacent elements.
    */
-  public static int getMaxSumApproach1(int[] arr) {
+public
+  static int getMaxSumApproach1(int[] arr) {
     int n = arr.length;
     int[] dp = new int[n];
 
@@ -51,7 +53,8 @@ public static int getMaxSumApproach1(int[] arr) {
    * @param arr The input array of integers.
    * @return The maximum sum of non-adjacent elements.
    */
-  public static int getMaxSumApproach2(int[] arr) {
+public
+  static int getMaxSumApproach2(int[] arr) {
     int n = arr.length;
 
     // Two variables to keep track of previous two results:
@@ -82,4 +85,4 @@ public static int getMaxSumApproach2(int[] arr) {
 
     return prev1;
   }
-}
+}