diff --git a/paginated_contents/algorithms/4th_thousand/README.md b/paginated_contents/algorithms/4th_thousand/README.md
index f1841d6bd3..b710e12009 100644
--- a/paginated_contents/algorithms/4th_thousand/README.md
+++ b/paginated_contents/algorithms/4th_thousand/README.md
@@ -1,5 +1,11 @@
 | #    | 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       |
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/_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/thecc4re/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/thecc4re/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/thecc4re/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/thecc4re/Leetcode/compare/master...fishercoder1534:Leetcode:master.diff" target="_blank">pFad v4 Proxy</a></p></body>
</html>