fishercoder1534
diff --git a/‎paginated_contents/algorithms/4th_thousand/README.md
Copy file name to clipboardExpand all lines: paginated_contents/algorithms/4th_thousand/README.md
+1Lines changed: 1 addition & 0 deletions b/‎paginated_contents/algorithms/4th_thousand/README.md
Copy file name to clipboardExpand all lines: paginated_contents/algorithms/4th_thousand/README.md
+1Lines changed: 1 addition & 0 deletions
diff --git a/‎src/main/java/com/fishercoder/solutions/fourththousand/_3502.java
Copy file name to clipboard
+17Lines changed: 17 additions & 0 deletions b/‎src/main/java/com/fishercoder/solutions/fourththousand/_3502.java
Copy file name to clipboard
+17Lines changed: 17 additions & 0 deletions
diff --git a/‎src/test/java/com/fishercoder/fourththousand/_3502Test.java
Copy file name to clipboard
+22Lines changed: 22 additions & 0 deletions b/‎src/test/java/com/fishercoder/fourththousand/_3502Test.java
Copy file name to clipboard
+22Lines changed: 22 additions & 0 deletions
@@ -1,5 +1,6 @@
 | #    | 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       |
 | 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       |
 | 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       |
 
@@ -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;
+        }
+    }
+}
@@ -0,0 +1,22 @@
+package com.fishercoder.fourththousand;
+
+import com.fishercoder.solutions.fourththousand._3502;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+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}));
+    }
+
+}