diff --git a/cpp/_916.cpp b/cpp/_916.cpp
new file mode 100644
index 0000000000..7ac4a644a1
--- /dev/null
+++ b/cpp/_916.cpp
@@ -0,0 +1,34 @@
+class Solution {
+public:
+    vector<string> wordSubsets(vector<string>& words1, vector<string>& words2) {
+        int maxCharFreq[26] = {0};
+        int tempCharFreq[26];
+        for (const auto& word : words2) {
+            memset(tempCharFreq, 0, sizeof tempCharFreq);
+            for (char ch : word) {
+                tempCharFreq[ch - 'a']++;
+            }
+            for (int i = 0; i < 26; ++i) {
+                maxCharFreq[i] = max(maxCharFreq[i], tempCharFreq[i]);
+            }
+        } 
+        vector<string> universalWords;
+        for (const auto& word : words1) {
+            memset(tempCharFreq, 0, sizeof tempCharFreq);
+            for (char ch : word) {
+                tempCharFreq[ch - 'a']++;
+            }
+            bool isUniversal = true;
+            for (int i = 0; i < 26; ++i) {
+                if (maxCharFreq[i] > tempCharFreq[i]) {
+                    isUniversal = false;
+                    break;
+                }
+            }
+            if (isUniversal) {
+                universalWords.emplace_back(word);
+            }
+        }
+        return universalWords;
+    }
+};
diff --git a/javascript/_994.js b/javascript/_994.js
new file mode 100644
index 0000000000..67ab649ddd
--- /dev/null
+++ b/javascript/_994.js
@@ -0,0 +1,57 @@
+function orangesRotting(grid) {
+  const rows = grid.length;
+  const cols = grid[0].length;
+  let queue = [];
+  let freshOranges = 0;
+
+  // Initialize the queue with all rotten oranges and count fresh oranges
+  for (let r = 0; r < rows; r++) {
+      for (let c = 0; c < cols; c++) {
+          if (grid[r][c] === 2) {
+              queue.push([r, c]);
+          } else if (grid[r][c] === 1) {
+              freshOranges++;
+          }
+      }
+  }
+
+  // If there are no fresh oranges, return 0
+  if (freshOranges === 0) return 0;
+
+  let minutes = 0;
+  const directions = [
+      [0, 1], // right
+      [1, 0], // down
+      [0, -1], // left
+      [-1, 0] // up
+  ];
+
+  // Step 2: Perform BFS
+  while (queue.length > 0) {
+      let size = queue.length;
+      let newRotten = false;
+
+      for (let i = 0; i < size; i++) {
+          let [x, y] = queue.shift();
+
+          for (let [dx, dy] of directions) {
+              let nx = x + dx;
+              let ny = y + dy;
+
+              // Check if the neighboring cell is a fresh orange
+              if (nx >= 0 && ny >= 0 && nx < rows && ny < cols && grid[nx][ny] === 1) {
+                  grid[nx][ny] = 2; // Make it rotten
+                  freshOranges--; // Decrease count of fresh oranges
+                  queue.push([nx, ny]); // Add it to the queue
+                  newRotten = true;
+              }
+          }
+      }
+
+      // If rotten oranges exist, increment minutes
+      if (newRotten) minutes++;
+  }
+
+ // Check if there are any fresh oranges left
+  return freshOranges === 0 ? minutes : -1;
+}
diff --git a/paginated_contents/algorithms/1st_thousand/README.md b/paginated_contents/algorithms/1st_thousand/README.md
index 24e367d524..2979301b84 100644
--- a/paginated_contents/algorithms/1st_thousand/README.md
+++ b/paginated_contents/algorithms/1st_thousand/README.md
@@ -4,7 +4,7 @@
 | 991 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/)                                                                                                                         | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_991.java)                                                                  |                                                                               | Medium                           | Math, Greedy                                                         
 | 981 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)                                                                                                       | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_981.java)                                                                  | [:tv:](https://youtu.be/eVi4gDimCoo)                                          | Medium                           |
 | 997 | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/)                                                                                                                     | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_997.java)                                                                  |                                                                               | Easy                             |
-| 994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)                                                                                                                             | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_994.java)                                                                  |                                                                               | Medium                           | BFS                                                                  
+| 994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)                                                                                                                             | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_994.java)     [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_994.js)                                                             |                                                                               | Medium                           | BFS                                                                  
 | 993 | [Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/)                                                                                                               | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_993.java)                                                                  |                                                                               | Easy                             | Tree, BFS                                                            
 | 989 | [Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/)                                                                                                   | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_989.java)                                                                  |                                                                               | Easy                             | Array                                                                
 | 988 | [Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/)                                                                                       | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_988.java)                                                                  |                                                                               | Medium                           | Tree, DFS                                                            
diff --git a/paginated_contents/algorithms/3rd_thousand/README.md b/paginated_contents/algorithms/3rd_thousand/README.md
index ffdf514f08..05470a0328 100644
--- a/paginated_contents/algorithms/3rd_thousand/README.md
+++ b/paginated_contents/algorithms/3rd_thousand/README.md
@@ -280,5 +280,5 @@
 | 2011 | [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2011.java)                                       || Easy                                 ||
 | 2007 | [Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/)                                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2007.java)                                       || Medium                               ||
 | 2006 | [Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/)                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2006.java)                                       || Easy                                 ||
-| 2001 | [Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)                                                          | [Python3](../master/python3/2001.py), [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2001.java) || Medium                               ||
+| 2001 | [Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)                                                          | [Python3](https://github.com/fishercoder1534/Leetcode/blob/master/python3/2001.py), [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2001.java) || Medium                               ||
 | 2000 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/)                                                                                                        | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2000.java)                                   || Easy                                 ||
\ No newline at end of file
diff --git a/paginated_contents/algorithms/4th_thousand/README.md b/paginated_contents/algorithms/4th_thousand/README.md
index f20eb8035a..b710e12009 100644
--- a/paginated_contents/algorithms/4th_thousand/README.md
+++ b/paginated_contents/algorithms/4th_thousand/README.md
@@ -1,100 +1,117 @@
-| #    | Title                                                                                                                                                              | Solutions                                                                                                                         | Video                                                                         | Difficulty | Tag                                                                  
-|------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
-| 3349 | [Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3349.java) |                                                                               | Easy       |
-| 3340 | [Check Balanced String](https://leetcode.com/problems/check-balanced-string/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3340.java) |                                                                               | Easy       |
-| 3330 | [Find the Original Typed String I](https://leetcode.com/problems/find-the-original-typed-string-i/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3330.java) |                                                                               | Easy       |
-| 3324 | [Find the Sequence of Strings Appeared on the Screen](https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3324.java) |                                                                               | Easy       |
-| 3318 | [Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3318.java) |                                                                               | Easy       |
-| 3314 | [Construct the Minimum Bitwise Array I](https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/)                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3314.java) |                                                                               | Easy       |
-| 3304 | [Find the K-th Character in String Game I](https://leetcode.com/problems/find-the-k-th-character-in-string-game-i/)                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3304.java) |                                                                               | Easy       |
-| 3300 | [Minimum Element After Replacement With Digit Sum](https://leetcode.com/problems/minimum-element-after-replacement-with-digit-sum/)                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3300java)  |                                                                               | Easy       |
-| 3289 | [The Two Sneaky Numbers of Digitville](https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/)                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3289.java) |                                                                               | Easy       |
-| 3285 | [Find Indices of Stable Mountains](https://leetcode.com/problems/find-indices-of-stable-mountains/)                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3285.java) |                                                                               | Easy       |
-| 3280 | [Convert Date to Binary](https://leetcode.com/problems/convert-date-to-binary/)                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3280.java) |                                                                               | Easy       |
-| 3274 | [Check if Two Chessboard Squares Have the Same Color](https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/)                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3274.java) |                                                                               | Easy       |
-| 3270 | [Find the Key of the Numbers](https://leetcode.com/problems/find-the-key-of-the-numbers/)                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3270.java) |                                                                               | Easy       |
-| 3264 | [Final Array State After K Multiplication Operations I](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/)                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3264.java) |                                                                               | Easy       |
-| 3263 | [Convert Doubly Linked List to Array I](https://leetcode.com/problems/convert-doubly-linked-list-to-array-i/)                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3263.java) |                                                                               | Easy       |
-| 3258 | [Count Substrings That Satisfy K-Constraint I](https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-i/)                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3258.java) |                                                                               | Easy       |
-| 3254 | [Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3254.java) |                                                                               | Easy       |
-| 3249 | [Count the Number of Good Nodes](https://leetcode.com/problems/count-the-number-of-good-nodes/)                                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3249.java) |                                                                               | Medium     |
-| 3248 | [Snake in Matrix](https://leetcode.com/problems/snake-in-matrix/)                                                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3248.java) |                                                                               | Easy       |
-| 3243 | [Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/)                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3243.java) |                                                                               | Medium     |
-| 3242 | [Design Neighbor Sum Service](https://leetcode.com/problems/design-neighbor-sum-service/)                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3242.java) |                                                                               | Easy       |
-| 3241 | [Time Taken to Mark All Nodes](https://leetcode.com/problems/time-taken-to-mark-all-nodes/)                                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3241.java) |                                                                               | Hard       |
-| 3240 | [Minimum Number of Flips to Make Binary Grid Palindromic II](https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-ii/)            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3240.java) |                                                                               | Medium     |
-| 3239 | [Minimum Number of Flips to Make Binary Grid Palindromic I](https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/)              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3239.java) |                                                                               | Easy       |
-| 3238 | [Find the Number of Winning Players](https://leetcode.com/problems/find-the-number-of-winning-players/)                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3238.java) |                                                                               | Easy       |
-| 3237 | [Alt and Tab Simulation](https://leetcode.com/problems/alt-and-tab-simulation/)                                                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3237.java) |                                                                               | Medium     | 
-| 3234 | [Count the Number of Substrings With Dominant Ones](https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/)                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3234.java) |                                                                               | Medium     | Sliding Window
-| 3233 | [Find the Count of Numbers Which Are Not Special](https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special/)                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3233.java) |                                                                               | Medium     | Math
-| 3232 | [Find if Digit Game Can Be Won](https://leetcode.com/problems/find-if-digit-game-can-be-won/)                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3232.java) |                                                                               | Easy       |
-| 3226 | [Number of Bit Changes to Make Two Integers Equal](https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal/)                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3226.java) |                                                                               | Easy       |
-| 3224 | [Minimum Array Changes to Make Differences Equal](https://leetcode.com/problems/minimum-array-changes-to-make-differences-equal/)                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3224.java) |                                                                               | Medium     |
-| 3223 | [Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations/)                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3223.java) |                                                                               | Medium     |
-| 3222 | [Find the Winning Player in Coin Game](https://leetcode.com/problems/find-the-winning-player-in-coin-game/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3222.java) |                                                                               | Easy       | 
-| 3219 | [Minimum Cost for Cutting Cake II](https://leetcode.com/problems/minimum-cost-for-cutting-cake-ii/)                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3219.java) |                                                                               | Hard       | Greedy
-| 3218 | [Minimum Cost for Cutting Cake I](https://leetcode.com/problems/minimum-cost-for-cutting-cake-i/)                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3218.java) |                                                                               | Medium     | 
-| 3217 | [Delete Nodes From Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/)                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3217.java) |                                                                               | Medium     | LinkedList 
-| 3216 | [Lexicographically Smallest String After a Swap](https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/)                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3216.java) |                                                                               | Easy       | Greedy
-| 3212 | [Count Submatrices With Equal Frequency of X and Y](https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y/)                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3212.java) |                                                                               | Medium     | Prefix Sum
-| 3211 | [Generate Binary Strings Without Adjacent Zeros](https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros/)                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3211.java) |                                                                               | Medium     | Recursion, Backtracking
-| 3210 | [Find the Encrypted String](https://leetcode.com/problems/find-the-encrypted-string/)                                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3210.java) |                                                                               | Easy       |
-| 3208 | [Alternating Groups II](https://leetcode.com/problems/alternating-groups-ii/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3208.java) |                                                                               | Medium     |
-| 3206 | [Alternating Groups I](https://leetcode.com/problems/alternating-groups-i/)                                                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3206.java) |                                                                               | Easy       |
-| 3200 | [Maximum Height of a Triangle](https://leetcode.com/problems/maximum-height-of-a-triangle/)                                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3200.java) |                                                                               | Easy       |
-| 3199 | [Count Triplets with Even XOR Set Bits I](https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-i/)                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3199.java) |                                                                               | Easy       |
-| 3196 | [Maximize Total Cost of Alternating Subarrays](https://leetcode.com/problems/maximize-total-cost-of-alternating-subarrays/)                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3196.java) |                                                                               | Medium     |DP
-| 3195 | [Find the Minimum Area to Cover All Ones I](https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i/)                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3195.java) |                                                                               | Medium     |
-| 3194 | [Minimum Average of Smallest and Largest Elements](https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/)                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3194.java) |                                                                               | Easy       |
+| #    | Title                                                                                                                                                               | Solutions                                                                                                                         | Video                                                                         | Difficulty | Tag                                                                  
+|------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
+| 3502 | [Minimum Cost to Reach Every Position](https://leetcode.com/problems/minimum-cost-to-reach-every-position/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java) |                                                                               | Easy       |
+| 3491 | [Phone Number Prefix](https://leetcode.com/problems/phone-number-prefix/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3491.java) |                                                                               | Easy       |
+| 3477 | [Fruits Into Baskets II](https://leetcode.com/problems/fruits-into-baskets-ii/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3477.java) |                                                                               | Easy       |
+| 3471 | [Find the Largest Almost Missing Integer](https://leetcode.com/problems/find-the-largest-almost-missing-integer/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3471.java) |                                                                               | Easy       |
+| 3450 | [Maximum Students on a Single Bench](https://leetcode.com/problems/maximum-students-on-a-single-bench/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3450.java) |                                                                               | Easy       |
+| 3402 | [Minimum Operations to Make Columns Strictly Increasing](https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java) |                                                                               | Easy       |
+| 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java) |                                                                               | Easy       |
+| 3392 | [Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java) |                                                                               | Easy       |
+| 3386 | [Button with Longest Push Time](https://leetcode.com/problems/button-with-longest-push-time/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java) |                                                                               | Easy       |
+| 3379 | [Transformed Array](https://leetcode.com/problems/transformed-array/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java) |                                                                               | Easy       |
+| 3375 | [Minimum Operations to Make Array Values Equal to K](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java) |                                                                               | Easy       |
+| 3370 | [Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java) |                                                                               | Easy       |
+| 3364 | [Minimum Positive Sum Subarray](https://leetcode.com/problems/minimum-positive-sum-subarray/)                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java) |                                                                               | Easy       |
+| 3360 | [Stone Removal Game](https://leetcode.com/problems/stone-removal-game/)                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3360.java) |                                                                               | Easy       |
+| 3354 | [Make Array Elements Equal to Zero](https://leetcode.com/problems/make-array-elements-equal-to-zero/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3354.java) |                                                                               | Easy       |
+| 3353 | [Minimum Total Operations](https://leetcode.com/problems/minimum-total-operations/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3353.java) |                                                                               | Easy       |
+| 3349 | [Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3349.java) |                                                                               | Easy       |
+| 3345 | [Smallest Divisible Digit Product I](https://leetcode.com/problems/smallest-divisible-digit-product-i/)                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3345.java) |                                                                               | Easy       |
+| 3340 | [Check Balanced String](https://leetcode.com/problems/check-balanced-string/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3340.java) |                                                                               | Easy       |
+| 3330 | [Find the Original Typed String I](https://leetcode.com/problems/find-the-original-typed-string-i/)                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3330.java) |                                                                               | Easy       |
+| 3324 | [Find the Sequence of Strings Appeared on the Screen](https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/)                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3324.java) |                                                                               | Easy       |
+| 3318 | [Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/)                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3318.java) |                                                                               | Easy       |
+| 3314 | [Construct the Minimum Bitwise Array I](https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3314.java) |                                                                               | Easy       |
+| 3304 | [Find the K-th Character in String Game I](https://leetcode.com/problems/find-the-k-th-character-in-string-game-i/)                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3304.java) |                                                                               | Easy       |
+| 3300 | [Minimum Element After Replacement With Digit Sum](https://leetcode.com/problems/minimum-element-after-replacement-with-digit-sum/)                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3300java)  |                                                                               | Easy       |
+| 3289 | [The Two Sneaky Numbers of Digitville](https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/)                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3289.java) |                                                                               | Easy       |
+| 3285 | [Find Indices of Stable Mountains](https://leetcode.com/problems/find-indices-of-stable-mountains/)                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3285.java) |                                                                               | Easy       |
+| 3280 | [Convert Date to Binary](https://leetcode.com/problems/convert-date-to-binary/)                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3280.java) |                                                                               | Easy       |
+| 3274 | [Check if Two Chessboard Squares Have the Same Color](https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/)                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3274.java) |                                                                               | Easy       |
+| 3270 | [Find the Key of the Numbers](https://leetcode.com/problems/find-the-key-of-the-numbers/)                                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3270.java) |                                                                               | Easy       |
+| 3264 | [Final Array State After K Multiplication Operations I](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/)                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3264.java) |                                                                               | Easy       |
+| 3263 | [Convert Doubly Linked List to Array I](https://leetcode.com/problems/convert-doubly-linked-list-to-array-i/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3263.java) |                                                                               | Easy       |
+| 3258 | [Count Substrings That Satisfy K-Constraint I](https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-i/)                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3258.java) |                                                                               | Easy       |
+| 3254 | [Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/)                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3254.java) |                                                                               | Easy       |
+| 3249 | [Count the Number of Good Nodes](https://leetcode.com/problems/count-the-number-of-good-nodes/)                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3249.java) |                                                                               | Medium     |
+| 3248 | [Snake in Matrix](https://leetcode.com/problems/snake-in-matrix/)                                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3248.java) |                                                                               | Easy       |
+| 3243 | [Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/)                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3243.java) |                                                                               | Medium     |
+| 3242 | [Design Neighbor Sum Service](https://leetcode.com/problems/design-neighbor-sum-service/)                                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3242.java) |                                                                               | Easy       |
+| 3241 | [Time Taken to Mark All Nodes](https://leetcode.com/problems/time-taken-to-mark-all-nodes/)                                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3241.java) |                                                                               | Hard       |
+| 3240 | [Minimum Number of Flips to Make Binary Grid Palindromic II](https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-ii/)             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3240.java) |                                                                               | Medium     |
+| 3239 | [Minimum Number of Flips to Make Binary Grid Palindromic I](https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/)               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3239.java) |                                                                               | Easy       |
+| 3238 | [Find the Number of Winning Players](https://leetcode.com/problems/find-the-number-of-winning-players/)                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3238.java) |                                                                               | Easy       |
+| 3237 | [Alt and Tab Simulation](https://leetcode.com/problems/alt-and-tab-simulation/)                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3237.java) |                                                                               | Medium     | 
+| 3234 | [Count the Number of Substrings With Dominant Ones](https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/)                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3234.java) |                                                                               | Medium     | Sliding Window
+| 3233 | [Find the Count of Numbers Which Are Not Special](https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special/)                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3233.java) |                                                                               | Medium     | Math
+| 3232 | [Find if Digit Game Can Be Won](https://leetcode.com/problems/find-if-digit-game-can-be-won/)                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3232.java) |                                                                               | Easy       |
+| 3226 | [Number of Bit Changes to Make Two Integers Equal](https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal/)                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3226.java) |                                                                               | Easy       |
+| 3224 | [Minimum Array Changes to Make Differences Equal](https://leetcode.com/problems/minimum-array-changes-to-make-differences-equal/)                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3224.java) |                                                                               | Medium     |
+| 3223 | [Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3223.java) |                                                                               | Medium     |
+| 3222 | [Find the Winning Player in Coin Game](https://leetcode.com/problems/find-the-winning-player-in-coin-game/)                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3222.java) |                                                                               | Easy       | 
+| 3219 | [Minimum Cost for Cutting Cake II](https://leetcode.com/problems/minimum-cost-for-cutting-cake-ii/)                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3219.java) |                                                                               | Hard       | Greedy
+| 3218 | [Minimum Cost for Cutting Cake I](https://leetcode.com/problems/minimum-cost-for-cutting-cake-i/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3218.java) |                                                                               | Medium     | 
+| 3217 | [Delete Nodes From Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/)                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3217.java) |                                                                               | Medium     | LinkedList 
+| 3216 | [Lexicographically Smallest String After a Swap](https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/)                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3216.java) |                                                                               | Easy       | Greedy
+| 3212 | [Count Submatrices With Equal Frequency of X and Y](https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y/)                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3212.java) |                                                                               | Medium     | Prefix Sum
+| 3211 | [Generate Binary Strings Without Adjacent Zeros](https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros/)                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3211.java) |                                                                               | Medium     | Recursion, Backtracking
+| 3210 | [Find the Encrypted String](https://leetcode.com/problems/find-the-encrypted-string/)                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3210.java) |                                                                               | Easy       |
+| 3208 | [Alternating Groups II](https://leetcode.com/problems/alternating-groups-ii/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3208.java) |                                                                               | Medium     |
+| 3206 | [Alternating Groups I](https://leetcode.com/problems/alternating-groups-i/)                                                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3206.java) |                                                                               | Easy       |
+| 3200 | [Maximum Height of a Triangle](https://leetcode.com/problems/maximum-height-of-a-triangle/)                                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3200.java) |                                                                               | Easy       |
+| 3199 | [Count Triplets with Even XOR Set Bits I](https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-i/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3199.java) |                                                                               | Easy       |
+| 3196 | [Maximize Total Cost of Alternating Subarrays](https://leetcode.com/problems/maximize-total-cost-of-alternating-subarrays/)                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3196.java) |                                                                               | Medium     |DP
+| 3195 | [Find the Minimum Area to Cover All Ones I](https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3195.java) |                                                                               | Medium     |
+| 3194 | [Minimum Average of Smallest and Largest Elements](https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/)                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3194.java) |                                                                               | Easy       |
 | 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/) | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3192.java) |                                                                               | Medium     |
-| 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/)  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3191.java) |                                                                               | Medium     |
-| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/)  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3190.java) |                                                                               | Easy       |
-| 3189 | [Minimum Moves to Get a Peaceful Board](https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board/)                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3186.java) |                                                                               | Medium     | Greedy
-| 3186 | [Maximum Total Damage With Spell Casting](https://leetcode.com/problems/maximum-total-damage-with-spell-casting/)                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3186.java) |                                                                               | Medium     | DP
-| 3185 | [Count Pairs That Form a Complete Day II](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii/)                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3185.java) |                                                                               | Medium     |
-| 3184 | [Count Pairs That Form a Complete Day I](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/)                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3184.java) |                                                                               | Easy       |
-| 3178 | [Find the Child Who Has the Ball After K Seconds](https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/)                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3178.java) |                                                                               | Easy       |
-| 3175 | [Find The First Player to win K Games in a Row](https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/)                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3175.java) |                                                                               | Medium     |
-| 3174 | [Clear Digits](https://leetcode.com/problems/clear-digits/)                                                                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3174.java) |                                                                               | Easy       |
-| 3173 | [Bitwise OR of Adjacent Elements](https://leetcode.com/problems/bitwise-or-of-adjacent-elements/)                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3173.java) |                                                                               | Easy       |
-| 3168 | [Minimum Number of Chairs in a Waiting Room](https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room/)                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3168.java) |                                                                               | Easy       |
-| 3164 | [Find the Number of Good Pairs II](https://leetcode.com/problems/find-the-number-of-good-pairs-ii/)                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3164.java) |                                                                               | Medium     |
-| 3162 | [Find the Number of Good Pairs I](https://leetcode.com/problems/find-the-number-of-good-pairs-i/)                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3162.java) |                                                                               | Easy       |
-| 3158 | [Find the XOR of Numbers Which Appear Twice](https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice/)                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3158.java) |                                                                               | Easy       |
-| 3157 | [Find the Level of Tree with Minimum Sum](https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum/)                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3157.java) |                                                                               | Medium     |BFS
-| 3151 | [Special Array I](https://leetcode.com/problems/special-array-i/)                                                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3151.java) |                                                                               | Easy       |
-| 3146 | [Permutation Difference between Two Strings](https://leetcode.com/problems/permutation-difference-between-two-strings/)                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3146.java) |                                                                               | Easy       |
-| 3142 | [Check if Grid Satisfies Conditions](https://leetcode.com/problems/check-if-grid-satisfies-conditions/)                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3142.java) |                                                                               | Easy       |
-| 3136 | [Valid Word](https://leetcode.com/problems/valid-word/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3136.java) |                                                                               | Easy       |
-| 3131 | [Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3131.java) |                                                                               | Easy       |
-| 3127 | [Make a Square with the Same Color](https://leetcode.com/problems/make-a-square-with-the-same-color/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3127.java) |                                                                               | Easy       |
-| 3120 | [Count the Number of Special Characters I](https://leetcode.com/problems/count-the-number-of-special-characters-i/)                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3120.java) |                                                                               | Easy       |
-| 3114 | [Latest Time You Can Obtain After Replacing Characters](https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters/)                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3114.java) |                                                                               | Easy       | 
-| 3112 | [Minimum Time to Visit Disappearing Nodes](https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/)                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3112.java) |                                                                               | Medium     | Graph, Shortest Path
-| 3110 | [Score of a String](https://leetcode.com/problems/score-of-a-string/)                                                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3110.java) |                                                                               | Easy       |
-| 3099 | [Harshad Number](https://leetcode.com/problems/harshad-number/)                                                                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3099.java) |                                                                               | Easy       |
-| 3095 | [Shortest Subarray With OR at Least K I](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i/)                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3095.java) |                                                                               | Easy       |
-| 3090 | [Maximum Length Substring With Two Occurrences](https://leetcode.com/problems/maximum-length-substring-with-two-occurrences/)                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3090.java) |                                                                               | Easy       |
-| 3083 | [Existence of a Substring in a String and Its Reverse](https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse/)                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3083.java) |                                                                               | Easy       |
-| 3079 | [Find the Sum of Encrypted Integers](https://leetcode.com/problems/find-the-sum-of-encrypted-integers/)                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3079.java) |                                                                               | Easy       |
-| 3074 | [Apple Redistribution into Boxes](https://leetcode.com/problems/apple-redistribution-into-boxes/)                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3074.java) |                                                                               | Easy       |
-| 3069 | [Distribute Elements Into Two Arrays I](https://leetcode.com/problems/distribute-elements-into-two-arrays-i/)                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3069.java) |                                                                               | Easy       |
-| 3065 | [Minimum Operations to Exceed Threshold Value I](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/)                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3065.java) |                                                                               | Easy       |
-| 3063 | [Linked List Frequency](https://leetcode.com/problems/linked-list-frequency/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3063.java) |                                                                               | Easy       |
-| 3062 | [Winner of the Linked List Game](https://leetcode.com/problems/winner-of-the-linked-list-game/)                                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3062.java) |                                                                               | Easy       |
-| 3046 | [Split the Array](https://leetcode.com/problems/split-the-array/)                                                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3046.java) |                                                                               | Easy       |
-| 3042 | [Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/)                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3042.java) |                                                                               | Easy       |
-| 3038 | [Maximum Number of Operations With the Same Score I](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/)                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3038.java) |                                                                               | Easy       |
-| 3033 | [Modify the Matrix](https://leetcode.com/problems/modify-the-matrix/)                                                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3033.java) |                                                                               | Easy       |
-| 3032 | [Count Numbers With Unique Digits II](https://leetcode.com/problems/count-numbers-with-unique-digits-ii/)                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3032.java) |                                                                               | Easy       |
-| 3024 | [Type of Triangle](https://leetcode.com/problems/type-of-triangle/)                                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3024.java) |                                                                               | Easy       |
-| 3028 | [Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary/)                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3028.java) |                                                                               | Easy       |
-| 3019 | [Number of Changing Keys](https://leetcode.com/problems/number-of-changing-keys/)                                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3019.java) |                                                                               | Easy       |
-| 3016 | [Minimum Number of Pushes to Type Word II](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/)                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3016.java) |                                                                               | Medium     |
-| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/)                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3010.java) |                                                                               | Easy       |
-| 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i/)                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3014.java) |                                                                               | Easy       |
-| 3006 | [Find Beautiful Indices in the Given Array I](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/)                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3006.java) |                                                                               | Medium     |
-| 3005 | [Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/)                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3005.java) |                                                                               | Easy       |
-| 3004 | [Maximum Subtree of the Same Color](https://leetcode.com/problems/maximum-subtree-of-the-same-color/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3004.java) |                                                                               | Medium     | DFS, Tree
-| 3000 | [Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/)                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3000.java) |                                                                               | Easy       | 
+| 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/)   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3191.java) |                                                                               | Medium     |
+| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/)   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3190.java) |                                                                               | Easy       |
+| 3189 | [Minimum Moves to Get a Peaceful Board](https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3186.java) |                                                                               | Medium     | Greedy
+| 3186 | [Maximum Total Damage With Spell Casting](https://leetcode.com/problems/maximum-total-damage-with-spell-casting/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3186.java) |                                                                               | Medium     | DP
+| 3185 | [Count Pairs That Form a Complete Day II](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3185.java) |                                                                               | Medium     |
+| 3184 | [Count Pairs That Form a Complete Day I](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/)                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3184.java) |                                                                               | Easy       |
+| 3178 | [Find the Child Who Has the Ball After K Seconds](https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/)                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3178.java) |                                                                               | Easy       |
+| 3175 | [Find The First Player to win K Games in a Row](https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/)                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3175.java) |                                                                               | Medium     |
+| 3174 | [Clear Digits](https://leetcode.com/problems/clear-digits/)                                                                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3174.java) |                                                                               | Easy       |
+| 3173 | [Bitwise OR of Adjacent Elements](https://leetcode.com/problems/bitwise-or-of-adjacent-elements/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3173.java) |                                                                               | Easy       |
+| 3168 | [Minimum Number of Chairs in a Waiting Room](https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room/)                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3168.java) |                                                                               | Easy       |
+| 3164 | [Find the Number of Good Pairs II](https://leetcode.com/problems/find-the-number-of-good-pairs-ii/)                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3164.java) |                                                                               | Medium     |
+| 3162 | [Find the Number of Good Pairs I](https://leetcode.com/problems/find-the-number-of-good-pairs-i/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3162.java) |                                                                               | Easy       |
+| 3158 | [Find the XOR of Numbers Which Appear Twice](https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice/)                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3158.java) |                                                                               | Easy       |
+| 3157 | [Find the Level of Tree with Minimum Sum](https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3157.java) |                                                                               | Medium     |BFS
+| 3151 | [Special Array I](https://leetcode.com/problems/special-array-i/)                                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3151.java) |                                                                               | Easy       |
+| 3146 | [Permutation Difference between Two Strings](https://leetcode.com/problems/permutation-difference-between-two-strings/)                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3146.java) |                                                                               | Easy       |
+| 3142 | [Check if Grid Satisfies Conditions](https://leetcode.com/problems/check-if-grid-satisfies-conditions/)                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3142.java) |                                                                               | Easy       |
+| 3136 | [Valid Word](https://leetcode.com/problems/valid-word/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3136.java) |                                                                               | Easy       |
+| 3131 | [Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3131.java) |                                                                               | Easy       |
+| 3127 | [Make a Square with the Same Color](https://leetcode.com/problems/make-a-square-with-the-same-color/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3127.java) |                                                                               | Easy       |
+| 3120 | [Count the Number of Special Characters I](https://leetcode.com/problems/count-the-number-of-special-characters-i/)                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3120.java) |                                                                               | Easy       |
+| 3114 | [Latest Time You Can Obtain After Replacing Characters](https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters/)                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3114.java) |                                                                               | Easy       | 
+| 3112 | [Minimum Time to Visit Disappearing Nodes](https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/)                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3112.java) |                                                                               | Medium     | Graph, Shortest Path
+| 3110 | [Score of a String](https://leetcode.com/problems/score-of-a-string/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3110.java) |                                                                               | Easy       |
+| 3099 | [Harshad Number](https://leetcode.com/problems/harshad-number/)                                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3099.java) |                                                                               | Easy       |
+| 3095 | [Shortest Subarray With OR at Least K I](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i/)                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3095.java) |                                                                               | Easy       |
+| 3090 | [Maximum Length Substring With Two Occurrences](https://leetcode.com/problems/maximum-length-substring-with-two-occurrences/)                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3090.java) |                                                                               | Easy       |
+| 3083 | [Existence of a Substring in a String and Its Reverse](https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse/)                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3083.java) |                                                                               | Easy       |
+| 3079 | [Find the Sum of Encrypted Integers](https://leetcode.com/problems/find-the-sum-of-encrypted-integers/)                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3079.java) |                                                                               | Easy       |
+| 3074 | [Apple Redistribution into Boxes](https://leetcode.com/problems/apple-redistribution-into-boxes/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3074.java) |                                                                               | Easy       |
+| 3069 | [Distribute Elements Into Two Arrays I](https://leetcode.com/problems/distribute-elements-into-two-arrays-i/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3069.java) |                                                                               | Easy       |
+| 3065 | [Minimum Operations to Exceed Threshold Value I](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/)                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3065.java) |                                                                               | Easy       |
+| 3063 | [Linked List Frequency](https://leetcode.com/problems/linked-list-frequency/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3063.java) |                                                                               | Easy       |
+| 3062 | [Winner of the Linked List Game](https://leetcode.com/problems/winner-of-the-linked-list-game/)                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3062.java) |                                                                               | Easy       |
+| 3046 | [Split the Array](https://leetcode.com/problems/split-the-array/)                                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3046.java) |                                                                               | Easy       |
+| 3042 | [Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3042.java) |                                                                               | Easy       |
+| 3038 | [Maximum Number of Operations With the Same Score I](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/)                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3038.java) |                                                                               | Easy       |
+| 3033 | [Modify the Matrix](https://leetcode.com/problems/modify-the-matrix/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3033.java) |                                                                               | Easy       |
+| 3032 | [Count Numbers With Unique Digits II](https://leetcode.com/problems/count-numbers-with-unique-digits-ii/)                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3032.java) |                                                                               | Easy       |
+| 3024 | [Type of Triangle](https://leetcode.com/problems/type-of-triangle/)                                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3024.java) |                                                                               | Easy       |
+| 3028 | [Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary/)                                                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3028.java) |                                                                               | Easy       |
+| 3019 | [Number of Changing Keys](https://leetcode.com/problems/number-of-changing-keys/)                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3019.java) |                                                                               | Easy       |
+| 3016 | [Minimum Number of Pushes to Type Word II](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/)                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3016.java) |                                                                               | Medium     |
+| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/)                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3010.java) |                                                                               | Easy       |
+| 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3014.java) |                                                                               | Easy       |
+| 3006 | [Find Beautiful Indices in the Given Array I](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/)                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3006.java) |                                                                               | Medium     |
+| 3005 | [Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3005.java) |                                                                               | Easy       |
+| 3004 | [Maximum Subtree of the Same Color](https://leetcode.com/problems/maximum-subtree-of-the-same-color/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3004.java) |                                                                               | Medium     | DFS, Tree
+| 3000 | [Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/)                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3000.java) |                                                                               | Easy       | 
diff --git a/paginated_contents/database/README.md b/paginated_contents/database/README.md
index d6b78134eb..7e62ee9bf7 100644
--- a/paginated_contents/database/README.md
+++ b/paginated_contents/database/README.md
@@ -6,6 +6,7 @@
 | 3059 |[Find All Unique Email Domains](https://leetcode.com/problems/find-all-unique-email-domains/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_3159.sql)                                || Easy |
 | 3051 |[Find Candidates for Data Scientist Position](https://leetcode.com/problems/find-candidates-for-data-scientist-position/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_3051.sql)                                || Easy |
 | 2990 |[Loan Types](https://leetcode.com/problems/loan-types/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2990.sql)                                || Easy |
+| 2879 |[Display the First Three Rows](https://leetcode.com/problems/display-the-first-three-rows/)| [Python3](https://github.com/fishercoder1534/Leetcode/blob/master/python3/2879.py)                                 || Easy |
 | 2205 |[The Number of Users That Are Eligible for Discount](https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2205.sql)                                || Easy |
 | 2082 |[The Number of Rich Customers](https://leetcode.com/problems/the-number-of-rich-customers/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2082.sql)                                || Easy |
 | 2072 |[The Winner University](https://leetcode.com/problems/the-winner-university/)| [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/database/_2072.sql)                                || Easy |
diff --git a/python3/2879.py b/python3/2879.py
new file mode 100644
index 0000000000..5444325892
--- /dev/null
+++ b/python3/2879.py
@@ -0,0 +1,4 @@
+import pandas as pd
+
+def selectFirstRows(employees: pd.DataFrame) -> pd.DataFrame:
+    return employees.head(3)
\ No newline at end of file
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3345.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3345.java
new file mode 100644
index 0000000000..933a1bb667
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3345.java
@@ -0,0 +1,24 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3345 {
+    public static class Solution1 {
+        public int smallestNumber(int n, int t) {
+            for (int num = n; ; num++) {
+                int digitSum = getDigitsProduct(num);
+                if (digitSum % t == 0) {
+                    return num;
+                }
+            }
+        }
+
+        private int getDigitsProduct(int num) {
+            int copy = num;
+            int product = 1;
+            while (copy != 0) {
+                product *= copy % 10;
+                copy /= 10;
+            }
+            return product;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3353.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3353.java
new file mode 100644
index 0000000000..247f0dd169
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3353.java
@@ -0,0 +1,19 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3353 {
+    public static class Solution1 {
+        public int minOperations(int[] nums) {
+            int minOps = 0;
+            int delta = 0;
+            int target = nums[nums.length - 1];
+            for (int i = nums.length - 2; i >= 0; i--) {
+                nums[i] += delta;
+                if (nums[i] != target) {
+                    delta += target - nums[i];
+                    minOps++;
+                }
+            }
+            return minOps;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3354.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3354.java
new file mode 100644
index 0000000000..87dcdad837
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3354.java
@@ -0,0 +1,51 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.Arrays;
+
+public class _3354 {
+    public static class Solution1 {
+        public int countValidSelections(int[] nums) {
+            int count = 0;
+            for (int i = 0; i < nums.length; i++) {
+                if (nums[i] == 0) {
+                    if (isValidWithMoveDirection(nums, i, true)) {
+                        count++;
+                    }
+                    if (isValidWithMoveDirection(nums, i, false)) {
+                        count++;
+                    }
+                }
+            }
+            return count;
+        }
+
+        private boolean isValidWithMoveDirection(int[] nums, int index, boolean moveLeft) {
+            int[] copy = Arrays.copyOf(nums, nums.length);
+            while (index >= 0 && index < nums.length) {
+                if (moveLeft) {
+                    if (copy[index] > 0) {
+                        copy[index]--;
+                        moveLeft = !moveLeft;
+                        index++;
+                    } else {
+                        index--;
+                    }
+                } else {
+                    if (copy[index] > 0) {
+                        copy[index]--;
+                        moveLeft = !moveLeft;
+                        index--;
+                    } else {
+                        index++;
+                    }
+                }
+            }
+            for (int num : copy) {
+                if (num != 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3360.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3360.java
new file mode 100644
index 0000000000..34fe2f0328
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3360.java
@@ -0,0 +1,16 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3360 {
+    public static class Solution1 {
+        public boolean canAliceWin(int n) {
+            int turns = 0;
+            int removeCount = 10;
+            while (n >= removeCount) {
+                n -= removeCount;
+                removeCount--;
+                turns++;
+            }
+            return turns % 2 != 0;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java
new file mode 100644
index 0000000000..d81bec1551
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java
@@ -0,0 +1,38 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.List;
+
+public class _3364 {
+    public static class Solution1 {
+        public int minimumSumSubarray(List<Integer> nums, int l, int r) {
+            int minSum = Integer.MAX_VALUE;
+            for (int len = l; len <= r; len++) {
+                int sum = findSmallestSum(nums, len);
+                if (sum > 0) {
+                    minSum = Math.min(minSum, sum);
+                }
+            }
+            return minSum == Integer.MAX_VALUE ? -1 : minSum;
+        }
+
+        private int findSmallestSum(List<Integer> nums, int len) {
+            int sum = 0;
+            int i = 0;
+            for (; i < len; i++) {
+                sum += nums.get(i);
+            }
+            int minSum = Integer.MAX_VALUE;
+            if (sum > 0) {
+                minSum = sum;
+            }
+            for (; i < nums.size(); i++) {
+                sum -= nums.get(i - len);
+                sum += nums.get(i);
+                if (sum > 0) {
+                    minSum = Math.min(minSum, sum);
+                }
+            }
+            return minSum;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java
new file mode 100644
index 0000000000..6e00f12a9a
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java
@@ -0,0 +1,23 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3370 {
+    public static class Solution1 {
+        public int smallestNumber(int n) {
+            for (int num = n; ; num++) {
+                if (allSetBits(num)) {
+                    return num;
+                }
+            }
+        }
+
+        private boolean allSetBits(int num) {
+            String binaryStr = Integer.toBinaryString(num);
+            for (char c : binaryStr.toCharArray()) {
+                if (c != '1') {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java
new file mode 100644
index 0000000000..f46a30b5b0
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java
@@ -0,0 +1,21 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.TreeMap;
+
+public class _3375 {
+    public static class Solution1 {
+        public int minOperations(int[] nums, int k) {
+            TreeMap<Integer, Integer> map = new TreeMap<>();
+            for (int num : nums) {
+                map.put(num, map.getOrDefault(num, 0) + 1);
+            }
+            if (map.firstKey() < k) {
+                return -1;
+            }
+            if (map.firstKey() == k) {
+                return map.size() - 1;
+            }
+            return map.size();
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java
new file mode 100644
index 0000000000..d3087915f2
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java
@@ -0,0 +1,26 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3379 {
+    public static class Solution1 {
+        public int[] constructTransformedArray(int[] nums) {
+            int[] result = new int[nums.length];
+            int len = nums.length;
+            for (int i = 0; i < len; i++) {
+                if (nums[i] > 0) {
+                    int moves = nums[i] % len;
+                    result[i] = nums[(i + moves) % len];
+                } else if (nums[i] < 0) {
+                    if (i + nums[i] >= 0) {
+                        result[i] = nums[i + nums[i]];
+                    } else {
+                        int moves = Math.abs(nums[i]) % len;
+                        result[i] = nums[(len + (i - moves)) % len];
+                    }
+                } else {
+                    result[i] = nums[i];
+                }
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java
new file mode 100644
index 0000000000..530e18ea6a
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _3386 {
+    public static class Solution1 {
+        public int buttonWithLongestTime(int[][] events) {
+            Map<Integer, Integer> map = new HashMap<>();
+            int ans = events[0][0];
+            map.put(events[0][0], events[0][1]);
+            for (int i = 1; i < events.length; i++) {
+                int duration = events[i][1] - events[i - 1][1];
+                if (map.getOrDefault(events[i][0], 0) < duration) {
+                    map.put(events[i][0], duration);
+                }
+            }
+            int maxDuration = events[0][1];
+            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+                if (entry.getValue() > maxDuration) {
+                    ans = entry.getKey();
+                    maxDuration = entry.getValue();
+                } else if (entry.getValue() == maxDuration) {
+                    if (entry.getKey() < ans) {
+                        ans = entry.getKey();
+                    }
+                }
+            }
+            return ans;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java
new file mode 100644
index 0000000000..12dfbad125
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java
@@ -0,0 +1,15 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3392 {
+    public static class Solution1 {
+        public int countSubarrays(int[] nums) {
+            int count = 0;
+            for (int i = 0; i < nums.length - 2; i++) {
+                if ((nums[i] + nums[i + 2]) * 2 == nums[i + 1]) {
+                    count++;
+                }
+            }
+            return count;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java
new file mode 100644
index 0000000000..9d7f727fe9
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java
@@ -0,0 +1,34 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _3396 {
+    public static class Solution1 {
+        public int minimumOperations(int[] nums) {
+            int ops = 0;
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int num : nums) {
+                map.put(num, map.getOrDefault(num, 0) + 1);
+            }
+            int i = 0;
+            while (!allDistinct(map)) {
+                ops++;
+                int target = i + 3;
+                for (; i < target && i < nums.length; i++) {
+                    map.put(nums[i], map.get(nums[i]) - 1);
+                }
+            }
+            return ops;
+        }
+
+        private boolean allDistinct(Map<Integer, Integer> map) {
+            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+                if (entry.getValue() > 1) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java
new file mode 100644
index 0000000000..88e07e77ea
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java
@@ -0,0 +1,18 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3402 {
+    public static class Solution1 {
+        public int minimumOperations(int[][] grid) {
+            int ops = 0;
+            for (int j = 0; j < grid[0].length; j++) {
+                for (int i = 1; i < grid.length; i++) {
+                    if (grid[i][j] <= grid[i - 1][j]) {
+                        ops += grid[i - 1][j] - grid[i][j] + 1;
+                        grid[i][j] = grid[i - 1][j] + 1;
+                    }
+                }
+            }
+            return ops;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3450.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3450.java
new file mode 100644
index 0000000000..d24c051d61
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3450.java
@@ -0,0 +1,24 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.Set;
+
+public class _3450 {
+    public static class Solution1 {
+        public int maxStudentsOnBench(int[][] students) {
+            Map<Integer, Set<Integer>> map = new HashMap<>();
+            for (int[] student : students) {
+                Set<Integer> set = map.getOrDefault(student[1], new HashSet<>());
+                set.add(student[0]);
+                map.put(student[1], set);
+            }
+            int result = 0;
+            for (Map.Entry<Integer, Set<Integer>> entry : map.entrySet()) {
+                result = Math.max(result, entry.getValue().size());
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3471.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3471.java
new file mode 100644
index 0000000000..9926ed7f16
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3471.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.HashSet;
+import java.util.Set;
+import java.util.TreeMap;
+
+public class _3471 {
+    public static class Solution1 {
+        public int largestInteger(int[] nums, int k) {
+            TreeMap<Integer, Integer> map = new TreeMap<>();
+            for (int num : nums) {
+                map.put(num, 0);
+            }
+            for (int i = 0; i <= nums.length - k; i++) {
+                Set<Integer> set = new HashSet<>();
+                for (int j = i; j < i + k; j++) {
+                    if (set.add(nums[j])) {
+                        map.put(nums[j], map.getOrDefault(nums[j], 0) + 1);
+                    }
+                }
+            }
+            int ans = -1;
+            for (int key : map.keySet()) {
+                if (map.get(key) == 1) {
+                    ans = key;
+                }
+            }
+            return ans;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3477.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3477.java
new file mode 100644
index 0000000000..f2054202fa
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3477.java
@@ -0,0 +1,24 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3477 {
+    public static class Solution1 {
+        public int numOfUnplacedFruits(int[] fruits, int[] baskets) {
+            for (int i = 0; i < fruits.length; i++) {
+                for (int j = 0; j < baskets.length; j++) {
+                    if (fruits[i] <= baskets[j]) {
+                        baskets[j] = -1;
+                        fruits[i] = -1;
+                        break;
+                    }
+                }
+            }
+            int count = 0;
+            for (int i = 0; i < fruits.length; i++) {
+                if (fruits[i] > -1) {
+                    count++;
+                }
+            }
+            return count;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3491.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3491.java
new file mode 100644
index 0000000000..fecbad9937
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3491.java
@@ -0,0 +1,16 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3491 {
+    public static class Solution1 {
+        public boolean phonePrefix(String[] numbers) {
+            for (int i = 0; i < numbers.length; i++) {
+                for (int j = 0; j < numbers.length; j++) {
+                    if (i != j && numbers[i].startsWith(numbers[j])) {
+                        return false;
+                    }
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java
new file mode 100644
index 0000000000..98c94c7726
--- /dev/null
+++ b/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java
@@ -0,0 +1,17 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3502 {
+    public static class Solution1 {
+        public int[] minCosts(int[] cost) {
+            int[] res = new int[cost.length];
+            int min = cost[0];
+            for (int i = 0; i < cost.length; i++) {
+                if (cost[i] < min) {
+                    min = cost[i];
+                }
+                res[i] = min;
+            }
+            return res;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3345Test.java b/src/test/java/com/fishercoder/fourththousand/_3345Test.java
new file mode 100644
index 0000000000..9f4f208ee7
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3345Test.java
@@ -0,0 +1,21 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3345;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3345Test {
+    private _3345.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3345.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(10, solution1.smallestNumber(10, 2));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3353Test.java b/src/test/java/com/fishercoder/fourththousand/_3353Test.java
new file mode 100644
index 0000000000..adf77361d5
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3353Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3353;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3353Test {
+    private _3353.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3353.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.minOperations(new int[] {1, 4, 2}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(0, solution1.minOperations(new int[] {10, 10, 10}));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3354Test.java b/src/test/java/com/fishercoder/fourththousand/_3354Test.java
new file mode 100644
index 0000000000..406395cd2d
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3354Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3354;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3354Test {
+    private _3354.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3354.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.countValidSelections(new int[] {1, 0, 2, 0, 3}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(
+                3, solution1.countValidSelections(new int[] {16, 13, 10, 0, 0, 0, 10, 6, 7, 8, 7}));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3364Test.java b/src/test/java/com/fishercoder/fourththousand/_3364Test.java
new file mode 100644
index 0000000000..80f4d7d955
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3364Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3364;
+import java.util.Arrays;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3364Test {
+    private _3364.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3364.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.minimumSumSubarray(Arrays.asList(3, -2, 1, 4), 2, 3));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(8, solution1.minimumSumSubarray(Arrays.asList(-12, 8), 1, 1));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3375Test.java b/src/test/java/com/fishercoder/fourththousand/_3375Test.java
new file mode 100644
index 0000000000..46d3bca17f
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3375Test.java
@@ -0,0 +1,31 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3375;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3375Test {
+    private _3375.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3375.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.minOperations(new int[] {5, 2, 5, 4, 5}, 2));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(-1, solution1.minOperations(new int[] {2, 1, 2}, 2));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(4, solution1.minOperations(new int[] {9, 7, 5, 3}, 1));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3379Test.java b/src/test/java/com/fishercoder/fourththousand/_3379Test.java
new file mode 100644
index 0000000000..2d2daf2c83
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3379Test.java
@@ -0,0 +1,34 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+import com.fishercoder.solutions.fourththousand._3379;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3379Test {
+    private _3379.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3379.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(
+                new int[] {1, 1, 1, 3},
+                solution1.constructTransformedArray(new int[] {3, -2, 1, 1}));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(
+                new int[] {-1, -1, 4}, solution1.constructTransformedArray(new int[] {-1, 4, -1}));
+    }
+
+    @Test
+    public void test3() {
+        assertArrayEquals(new int[] {-10}, solution1.constructTransformedArray(new int[] {-10}));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3386Test.java b/src/test/java/com/fishercoder/fourththousand/_3386Test.java
new file mode 100644
index 0000000000..703d54bb06
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3386Test.java
@@ -0,0 +1,53 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.fourththousand._3386;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3386Test {
+    private _3386.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3386.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(
+                1,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[1,2],[2,5],[3,9],[1,15]")));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(
+                2,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[9,4],[19,5],[2,8],[3,11],[2,15]")));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(
+                2,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[7,1],[19,3],[9,4],[12,5],[2,8],[15,10],[18,12],[7,14],[19,16]")));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(
+                16,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[5,5],[16,17],[16,19]")));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3402Test.java b/src/test/java/com/fishercoder/fourththousand/_3402Test.java
new file mode 100644
index 0000000000..37a664802e
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3402Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.fourththousand._3402;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3402Test {
+    private _3402.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3402.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(
+                15,
+                solution1.minimumOperations(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[3,2],[1,3],[3,4],[0,1]")));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3450Test.java b/src/test/java/com/fishercoder/fourththousand/_3450Test.java
new file mode 100644
index 0000000000..be698b7186
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3450Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.fourththousand._3450;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3450Test {
+    private _3450.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3450.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(
+                3,
+                solution1.maxStudentsOnBench(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[1,2],[2,2],[3,3],[1,3],[2,3]")));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3471Test.java b/src/test/java/com/fishercoder/fourththousand/_3471Test.java
new file mode 100644
index 0000000000..f14977034d
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3471Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3471;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3471Test {
+    private _3471.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3471.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(7, solution1.largestInteger(new int[] {3, 9, 2, 1, 7}, 3));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(0, solution1.largestInteger(new int[] {0, 0}, 2));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3491Test.java b/src/test/java/com/fishercoder/fourththousand/_3491Test.java
new file mode 100644
index 0000000000..2e8d934bed
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3491Test.java
@@ -0,0 +1,21 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3491;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3491Test {
+    private _3491.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3491.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.phonePrefix(new String[] {"1", "2", "4", "3"}));
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3502Test.java b/src/test/java/com/fishercoder/fourththousand/_3502Test.java
new file mode 100644
index 0000000000..7159fef0c3
--- /dev/null
+++ b/src/test/java/com/fishercoder/fourththousand/_3502Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+import com.fishercoder.solutions.fourththousand._3502;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3502Test {
+    private _3502.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3502.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(
+                new int[] {5, 3, 3, 1, 1, 1}, solution1.minCosts(new int[] {5, 3, 4, 1, 3, 2}));
+    }
+}

<!DOCTYPE html PUBLIC '-//W3C//DTD XHTML 1.0 Transitional//EN' 'http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd'>
<html xmlns='http://www.w3.org/1999/xhtml'>
<head>
<title>pFad - Phonifier reborn</title>
<meta http-equiv='Content-Type' content='text/html; charset=utf-8' />
</head>
<body>
<h1>Pfad - The Proxy pFad of &#169; 2024 Garber Painting. All rights reserved.</h1>


<!-- Disclaimer -->
<p>Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.</p>
<br>
<p>Alternative Proxies:</p><p><a href="http://rainy.clevelandohioweatherforecast.com/php-proxy/index.php?q=https://github.com/avestamh/Leetcode/compare/master...fishercoder1534:Leetcode:master.diff" target="_blank">Alternative Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/index.php?u=https://github.com/avestamh/Leetcode/compare/master...fishercoder1534:Leetcode:master.diff" target="_blank">pFad Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v3index.php?u=https://github.com/avestamh/Leetcode/compare/master...fishercoder1534:Leetcode:master.diff" target="_blank">pFad v3 Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v4index.php?u=https://github.com/avestamh/Leetcode/compare/master...fishercoder1534:Leetcode:master.diff" target="_blank">pFad v4 Proxy</a></p></body>
</html>