Dependency updates

Author: spannm

pom.xml

@@ -5,7 +5,7 @@
     <parent>
         <groupId>org.basepom</groupId>
         <artifactId>basepom-oss</artifactId>
-        <version>59</version>
+        <version>61</version>
     </parent>
 
     <groupId>io.github.spannm</groupId>
@@ -46,8 +46,8 @@
 
         <dep.javapoet.version>1.13.0</dep.javapoet.version>
         <dep.slf4j-api.version>2.1.0-alpha1</dep.slf4j-api.version>
-        <dep.junit.version>5.10.2</dep.junit.version>
-        <dep.assertj.version>3.26.0</dep.assertj.version>
+        <dep.junit.version>5.10.4</dep.junit.version>
+        <dep.assertj.version>3.27.3</dep.assertj.version>
 
         <basepom.check.fail-dependency>false</basepom.check.fail-dependency>
         <basepom.check.skip-spotbugs>true</basepom.check.skip-spotbugs>

src/main/java/io/github/spannm/leetcode/lc0/lc0000/Problem0049.java

@@ -9,6 +9,7 @@
  */
 class Problem0049 extends LeetcodeProblem {
 
+    @SuppressWarnings("PMD.UseArraysAsList")
     List<List<String>> groupAnagrams(String[] _strs) {
         Map<List<String>, List<String>> grouped = new LinkedHashMap<>();
         for (String s : _strs) {

src/main/java/io/github/spannm/leetcode/lc0/lc0200/Problem0249.java

@@ -6,6 +6,7 @@
 
 class Problem0249 extends LeetcodeProblem {
 
+    @SuppressWarnings("PMD.UseArraysAsList")
     List<List<String>> groupStrings(String[] _strings) {
 
         List<List<String>> result = new ArrayList<>();

src/main/java/io/github/spannm/leetcode/lc0/lc0900/Problem0966.java

@@ -2,20 +2,16 @@
 
 import io.github.spannm.leetcode.LeetcodeProblem;
 
-import java.util.HashMap;
-import java.util.HashSet;
-import java.util.Map;
-import java.util.Set;
+import java.util.*;
 
 class Problem0966 extends LeetcodeProblem {
 
     String[] spellchecker(String[] _wordlist, String[] _queries) {
         Map<String, String> caseMap = new HashMap<>();
-        Set<String> set = new HashSet<>();
+        Set<String> set = new HashSet<>(Arrays.asList(_wordlist));
 
         for (String word : _wordlist) {
             caseMap.putIfAbsent(word.toLowerCase(), word);
-            set.add(word);
         }
 
         Map<String, String> vowelMap = new HashMap<>();

src/main/java/io/github/spannm/leetcode/lc1/lc1200/Problem1258.java

@@ -44,6 +44,7 @@ private String formWord(String[] _words) {
         return sb.substring(0, sb.length() - 1);
     }
 
+    @SuppressWarnings("PMD.UseArraysAsList")
     private Map<String, Set<String>> buildSynonymDict(String[] _words, List<List<String>> _synonyms) {
         Map<String, Set<String>> map = new HashMap<>();
         for (String key : _words) {

src/main/java/io/github/spannm/leetcode/lc2/lc2400/Problem2451.java

@@ -11,6 +11,7 @@
  */
 class Problem2451 extends LeetcodeProblem {
 
+    @SuppressWarnings("PMD.UseArraysAsList")
     String oddString(String[] words) {
         var d = new HashMap<String, List<String>>();
         for (var s : words) {