Add or modify solutions: feat: add/update solution(s) to lc problem(s): No.2501

Author: nikhilchikate

solution/2500-2599/2501.Longest Square Streak in an Array/Solution3.java

@@ -1,6 +1,6 @@
 class Solution {
     private Map<Integer, Integer> memo = new HashMap<>(); // Memoization map
-    private Set<Integer> numSet = new HashSet<>(); // Set of numbers
+    private Set<Integer> numSet = new HashSet<>();        // Set of numbers
 
     public int longestSquareStreak(int[] nums) {
         // Early exit if the array length is less than 2
@@ -33,16 +33,16 @@ private int dfs(int x) {
         }
 
         // Calculate the next number in the square streak
-        long next = (long) x * x; // Use long to avoid overflow
+        long next = (long)x * x; // Use long to avoid overflow
         // If the next number exceeds the maximum allowed value, return 0
         if (next > 100000) {
             memo.put(x, 1); // Only count this number itself
             return 1;
         }
 
         // Recursively calculate the streak
-        int streak = 1 + dfs((int) next); // Include the current number in the streak
-        memo.put(x, streak); // Cache the result
+        int streak = 1 + dfs((int)next); // Include the current number in the streak
+        memo.put(x, streak);             // Cache the result
         return streak;
     }
 }

solution/2500-2599/2501.Longest Square Streak in an Array/Solution4.java

@@ -1,8 +1,8 @@
 public class Solution {
     public int longestSquareStreak(int[] nums) {
-        int maxStreak = -1; // Track the maximum streak
-        final int MAX_NUM = (int) Math.pow(10, 5); // Maximum value for nums
-        boolean[] exists = new boolean[MAX_NUM + 1]; // Track existence of numbers
+        int maxStreak = -1;                           // Track the maximum streak
+        final int MAX_NUM = (int)Math.pow(10, 5);     // Maximum value for nums
+        boolean[] exists = new boolean[MAX_NUM + 1];  // Track existence of numbers
         boolean[] visited = new boolean[MAX_NUM + 1]; // Track visited numbers
 
         // Mark existing numbers
@@ -15,15 +15,15 @@ public int longestSquareStreak(int[] nums) {
             if (!exists[i] || visited[i]) {
                 continue; // Skip if number doesn't exist or is already visited
             }
-            visited[i] = true; // Mark as visited
+            visited[i] = true;    // Mark as visited
             int streakLength = 1; // Start streak length
-            long j = (long) i * i; // Calculate square (use long to avoid overflow)
+            long j = (long)i * i; // Calculate square (use long to avoid overflow)
 
             // Continue while j is valid and exists
-            while (j >= 0 && j <= MAX_NUM && exists[(int) j]) {
-                visited[(int) j] = true; // Mark as visited
-                streakLength++; // Increase streak length
-                j = j * j; // Move to next square
+            while (j >= 0 && j <= MAX_NUM && exists[(int)j]) {
+                visited[(int)j] = true; // Mark as visited
+                streakLength++;         // Increase streak length
+                j = j * j;              // Move to next square
             }
 
             // Update maximum streak if valid