githubniraj
diff --git a/‎paginated_contents/algorithms/3rd_thousand/README.md
Lines changed: 1 addition & 0 deletions b/‎paginated_contents/algorithms/3rd_thousand/README.md
Lines changed: 1 addition & 0 deletions
diff --git a/‎src/main/java/com/fishercoder/solutions/thirdthousand/_2460.java
Lines changed: 32 additions & 0 deletions b/‎src/main/java/com/fishercoder/solutions/thirdthousand/_2460.java
Lines changed: 32 additions & 0 deletions
diff --git a/‎src/test/java/com/fishercoder/thirdthousand/_2460Test.java
Lines changed: 27 additions & 0 deletions b/‎src/test/java/com/fishercoder/thirdthousand/_2460Test.java
Lines changed: 27 additions & 0 deletions
@@ -48,6 +48,7 @@
 | 2487 | [Remove Nodes From Linked List](https://leetcode.com/problems/remove-nodes-from-linked-list/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2487.java)                                       || Medium       
10000
                        | LinkedList, Stack              
 | 2485 | [Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2485.java)                                       || Easy                                 ||
 | 2467 | [Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2469.java)                                       || Easy                                 ||
+| 2460 | [Apply Operations to an Array](https://leetcode.com/problems/apply-operations-to-an-array/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2460.java)                                       || Easy                                 ||
 | 2455 | [Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2455.java)                                       || Easy                                 ||
 | 2451 | [Odd String Difference](https://leetcode.com/problems/odd-string-difference/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2451.java)                                       || Easy                                 |
 | 2446 | [Determine if Two Events Have Conflict](https://leetcode.com/problems/determine-if-two-events-have-conflict/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2446.java)                                       || Easy                                 |
 
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2460 {
+    public static class Solution1 {
+        public int[] applyOperations(int[] nums) {
+            for (int i = 0; i < nums.length - 1; i++) {
+                if (nums[i] == nums[i + 1]) {
+                    nums[i] *= 2;
+                    nums[i + 1] = 0;
+                }
+            }
+            //i points at the first zero element, j keeps moving and bypassing zeroes to find the next non-zero element
+            for (int i = 0, j = 0; i < nums.length && j < nums.length; ) {
+                while (i < nums.length && nums[i] != 0) {
+                    i++;
+                }
+                if (j < i) {
+                    j = i;
+                }
+                while (j < nums.length && nums[j] == 0) {
+                    j++;
+                }
+                if (j < nums.length) {
+                    nums[i++] = nums[j];
+                    nums[j++] = 0;
+                }
+            }
+            return nums;
+        }
+
+    }
+}
@@ -0,0 +1,27 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2460;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+public class _2460Test {
+    private static _2460.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2460.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{1, 4, 2, 0, 0, 0}, solution1.applyOperations(new int[]{1, 2, 2, 1, 1, 0}));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{1, 0}, solution1.applyOperations(new int[]{0, 1}));
+    }
+
+}