Add solution #2460

Author: JoshCrozier

README.md

@@ -662,6 +662,7 @@
 2425|[Bitwise XOR of All Pairings](./2425-bitwise-xor-of-all-pairings.js)|Medium|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|
 2429|[Minimize XOR](./2429-minimize-xor.js)|Medium|
+2460|[Apply Operations to an Array](./2460-apply-operations-to-an-array.js)|Easy|
 2462|[Total Cost to Hire K Workers](./2462-total-cost-to-hire-k-workers.js)|Medium|
 2467|[Most Profitable Path in a Tree](./2467-most-profitable-path-in-a-tree.js)|Medium|
 2469|[Convert the Temperature](./2469-convert-the-temperature.js)|Easy|

solutions/2460-apply-operations-to-an-array.js

@@ -0,0 +1,33 @@
+/**
+ * 2460. Apply Operations to an Array
+ * https://leetcode.com/problems/apply-operations-to-an-array/
+ * Difficulty: Easy
+ *
+ * You are given a 0-indexed array nums of size n consisting of non-negative integers.
+ *
+ * You need to apply n - 1 operations to this array where, in the ith operation (0-indexed),
+ * you will apply the following on the ith element of nums:
+ * - If nums[i] == nums[i + 1], then multiply nums[i] by 2 and set nums[i + 1] to 0.
+ *   Otherwise, you skip this operation.
+ *
+ * After performing all the operations, shift all the 0's to the end of the array.
+ * - For example, the array [1,0,2,0,0,1] after shifting all its 0's to the end, is [1,2,1,0,0,0].
+ *
+ * Return the resulting array.
+ *
+ * Note that the operations are applied sequentially, not all at once.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var applyOperations = function(nums) {
+  for (let i = 0; i < nums.length - 1; i++) {
+    if (nums[i] === nums[i + 1]) {
+      nums[i] *= 2;
+      nums[i + 1] = 0;
+    }
+  }
+  return [...nums.filter(n => n), ...nums.filter(n => !n)];
+};