Improved task 3646

Author: javadev

src/main/java/g3601_3700/s3646_next_special_palindrome_number/Solution.java

@@ -1,6 +1,6 @@
 package g3601_3700.s3646_next_special_palindrome_number;
 
-// #Hard #Weekly_Contest_462 #2025_08_10_Time_20_ms_(77.60%)_Space_45.50_MB_(18.75%)
+// #Hard #Weekly_Contest_462 #2025_08_11_Time_22_ms_(100.00%)_Space_45.26_MB_(100.00%)
 
 import java.util.ArrayList;
 import java.util.Collections;
@@ -10,17 +10,17 @@
 import java.util.Set;
 
 public class Solution {
-    private final List<Long> specials = new ArrayList<>();
+    private final static List<Long> SPECIALS = new ArrayList<>();
 
     public long specialPalindrome(long n) {
-        if (specials.isEmpty()) {
-            init(specials);
+        if (SPECIALS.isEmpty()) {
+            init(SPECIALS);
         }
-        int pos = Collections.binarySearch(specials, n + 1);
+        int pos = Collections.binarySearch(SPECIALS, n + 1);
         if (pos < 0) {
             pos = -pos - 1;
         }
-        return specials.get(pos);
+        return SPECIALS.get(pos);
     }
 
     private void init(List<Long> v) {