Fixing lint issues

Author: zodac

2024/src/main/java/me/zodac/advent/Day22.java

@@ -87,8 +87,9 @@ public static long calculateMaximumPossibleBananas(final Collection<Integer> ini
 
             final Collection<Long> existingDiffs = new HashSet<>();
 
+            final int numberOfPrices = prices.size();
             long runningDiff = 0L;
-            for (int i = 1; i < prices.size(); i++) {
+            for (int i = 1; i < numberOfPrices; i++) {
                 // Diff calculated based on following logic, gives a concise value for the diff that can be used for comparisons
                 // https://github.com/p-kovacs/advent-of-code-2024/blob/master/src/main/java/com/github/pkovacs/aoc/y2024/Day22.java#L33
                 runningDiff = (runningDiff % DIFF_RADIX_CUBED) * DIFF_RADIX + (prices.get(i) - prices.get(i - 1) + DIFF_RADIX_OFFSET);
@@ -169,5 +170,4 @@ private static long mix(final long first, final long second) {
     private static long prune(final long input) {
         return input % PRUNE_CONSTANT;
     }
-
 }

common-utils/src/main/java/me/zodac/advent/input/InputReader.java

@@ -365,40 +365,6 @@ private Grouper(final Stream<? extends T> stream) {
             this.stream = stream;
         }
 
-        /**
-         * Groups the {@code stream} of lines into {@link List}s, where each group has a size of {@code sizeOfGroup}.
-         *
-         * @param sizeOfGroup the size of the groups
-         * @return the group of {@link List}s of lines of the output type
-         */
-        public List<List<T>> bySize(final int sizeOfGroup) {
-            final List<? extends T> list = stream.toList();
-            final List<List<T>> groups = new ArrayList<>();
-            final int sizeOfList = list.size();
-            List<T> currentGroup = new ArrayList<>();
-            currentGroup.add(list.getFirst());
-
-            for (int i = 1; i < sizeOfList; i++) {
-                final T line = list.get(i);
-
-                if (i % sizeOfGroup == 0) {
-                    if (!currentGroup.isEmpty()) {
-                        groups.add(currentGroup);
-                    }
-                    currentGroup = new ArrayList<>();
-                    currentGroup.add(line);
-                } else {
-                    currentGroup.add(line);
-                }
-            }
-
-            // Add last group if not empty
-            if (!currentGroup.isEmpty()) {
-                groups.add(currentGroup);
-            }
-            return groups;
-        }
-
         /**
          * Groups the {@code stream} of lines into {@link List}s, where each group is a split that is delimited when the provided
          * {@link Predicate} is met.