diff --git "a/leetcode2/1easy/\352\271\200\353\214\200\354\233\220/Q3402.java" "b/leetcode2/1easy/\352\271\200\353\214\200\354\233\220/Q3402.java"
new file mode 100644
index 00000000..39be3e2e
--- /dev/null
+++ "b/leetcode2/1easy/\352\271\200\353\214\200\354\233\220/Q3402.java"
@@ -0,0 +1,17 @@
+class Solution {
+    public int minimumOperations(int[][] grid) {
+        int n = grid.length;
+        int m = grid[0].length;
+        int answer = 0;
+        for (int i = 1; i < n; i++) {
+            for (int j = 0; j < m; j++) {
+                if (grid[i][j] <= grid[i - 1][j]) {
+                    answer += (grid[i - 1][j] + 1) - grid[i][j];
+                    grid[i][j] = grid[i - 1][j] + 1;
+                }
+            }
+        }
+
+        return answer;
+    }
+}
\ No newline at end of file
diff --git "a/leetcode2/2medium/\352\271\200\353\214\200\354\233\220/Q2770.java" "b/leetcode2/2medium/\352\271\200\353\214\200\354\233\220/Q2770.java"
new file mode 100644
index 00000000..c4c7e7e2
--- /dev/null
+++ "b/leetcode2/2medium/\352\271\200\353\214\200\354\233\220/Q2770.java"
@@ -0,0 +1,21 @@
+class Solution {
+    public int maximumJumps(int[] nums, int target) {
+        int n = nums.length;
+        int[] dp = new int[n];
+        Arrays.fill(dp, -1);
+        dp[0] = 0;
+
+        for (int i = 1; i < n; i++) {
+            int dst = nums[i];
+            for (int j = 0; j < i; j++) {
+                int st = nums[j];
+
+                if (dp[j] != -1 && Math.abs(dst - st) <= target) {
+                    dp[i] = Math.max(dp[i], dp[j] + 1);
+                }
+            }
+        }
+
+        return dp[n - 1];
+    }
+}
\ No newline at end of file