Style: Auto-format Java files to fix linter issues

Author: Abhi13shek

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

@@ -2,7 +2,7 @@
 
 import java.util.HashMap;
 
-@SuppressWarnings({"rawtypes", "unchecked"})
+@SuppressWarnings({ "rawtypes", "unchecked" })
 final class LongestArithmeticSubsequence {
     private LongestArithmeticSubsequence() {
     }

src/main/java/com/thealgorithms/stacks/StackPostfixNotation.java

@@ -7,12 +7,15 @@
 /**
  * Utility class for evaluating postfix expressions using integer arithmetic.
  * <p>
- * Postfix notation, also known as Reverse Polish Notation (RPN), is a mathematical notation in which operators follow their operands.
- * This class provides a method to evaluate expressions written in postfix notation.
+ * Postfix notation, also known as Reverse Polish Notation (RPN), is a
+ * mathematical notation in which operators follow their operands.
+ * This class provides a method to evaluate expressions written in postfix
+ * notation.
  * </p>
  * <p>
  * For more information on postfix notation, refer to
- * <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation">Reverse Polish Notation (RPN) on Wikipedia</a>.
+ * <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation">Reverse
+ * Polish Notation (RPN) on Wikipedia</a>.
  * </p>
  */
 public final class StackPostfixNotation {
@@ -22,16 +25,16 @@ private StackPostfixNotation() {
     private static BiFunction<Integer, Integer, Integer> getOperator(final String operationSymbol) {
         // note the order of operands
         switch (operationSymbol) {
-        case "+":
-            return (a, b) -> b + a;
-        case "-":
-            return (a, b) -> b - a;
-        case "*":
-            return (a, b) -> b * a;
-        case "/":
-            return (a, b) -> b / a;
-        default:
-            throw new IllegalArgumentException("exp contains an unknown operation.");
+            case "+":
+                return (a, b) -> b + a;
+            case "-":
+                return (a, b) -> b - a;
+            case "*":
+                return (a, b) -> b * a;
+            case "/":
+                return (a, b) -> b / a;
+            default:
+                throw new IllegalArgumentException("exp contains an unknown operation.");
         }
     }
 
@@ -77,4 +80,4 @@ public static int postfixEvaluate(final String exp) {
     throw new IllegalArgumentException("exp is not a proper postfix expression.");
 }
 return s.pop();   }
-}
+} ̰