upd: linter bug fix

Author: ROSSARKO

app/src/main/java/hexlet/code/Engine.java

@@ -16,8 +16,7 @@ public static void userGreetings() {
     }
 
     public static void selectGame() {
-        String[] gamesList = {"1 - Greet", "2 - Even", "3 - Calc", "4 - GCD",
-                "5 - Progression", "6 - Prime", "0 - Exit"};
+        String[] gamesList = {"1 - Greet", "2 - Even", "3 - Calc", "4 - GCD", "5 - Progression", "6 - Prime", "0 - Exit"};
         Scanner sc = new Scanner(System.in);
         String formattedGamesList = Arrays.toString(gamesList)
                 .replace("[", "")
@@ -28,7 +27,7 @@ public static void selectGame() {
         System.out.println(formattedGamesList);
         int gameNumber = sc.nextInt();
         switch (gameNumber) {
-            case 0-> System.console();
+            case 0 -> System.console();
             case 1 -> Cli.userGreeting();
             case 2 -> EvenGame.gameLogic();
             case 3 -> Calc.gameLogic();

app/src/main/java/hexlet/code/EvenGame.java

@@ -4,12 +4,13 @@
 
 public class EvenGame {
     public static void gameLogic() {
+        final int rndMax = 100;
         Scanner sc = new Scanner(System.in);
         Engine.userGreetings();
         System.out.println("Answer 'yes' if the number is even, otherwise answer 'no'.");
         while (Engine.questionCounter != Engine.MAX_QUESTIONS) {
             Random rand = new Random();
-            int randNum = rand.nextInt(100);
+            int randNum = rand.nextInt(rndMax);
             System.out.println("Question: " + randNum);
             System.out.print("Your answer: ");
             String answer = sc.next();

app/src/main/java/hexlet/code/Progression.java

@@ -5,20 +5,20 @@
 
 public class Progression {
     public static void gameLogic() {
-        final int ARR_LENGTH = 10;
-        final int STEP_MAX = 10;
-        final int HIDE_ELEMENT_MAX = 9;
-        final int FIRST_NUM_MAX = 100;
+        final int arrLength = 10;
+        final int stepMax = 10;
+        final int hideElementMax = 9;
+        final int firstNumMax = 100;
         Scanner sc = new Scanner(System.in);
-        int[] progression = new int[ARR_LENGTH];
+        int[] progression = new int[arrLength];
         Random randNum = new Random();
 
         Engine.userGreetings();
         System.out.println("What number is missing in the progression?");
         while (Engine.questionCounter != Engine.MAX_QUESTIONS) {
-            int progressionStep = randNum.nextInt(1, STEP_MAX);
-            int randHideElement = randNum.nextInt(0, HIDE_ELEMENT_MAX);
-            int firstNum = randNum.nextInt(1, FIRST_NUM_MAX);
+            int progressionStep = randNum.nextInt(1, stepMax);
+            int randHideElement = randNum.nextInt(0, hideElementMax);
+            int firstNum = randNum.nextInt(1, firstNumMax);
             progression[0] = firstNum;
             for (int i = 1; i < progression.length; i++) {
                 progression[i] = progression[i - 1] + progressionStep;