Add solution #3353

JoshCrozier · JoshCrozier · commit 06c09069083d · 2025-07-20T23:36:25.000-05:00
diff --git a/README.md b/README.md
@@ -2668,6 +2668,7 @@
 3342|[Find Minimum Time to Reach Last Room II](./solutions/3342-find-minimum-time-to-reach-last-room-ii.js)|Medium|
 3343|[Count Number of Balanced Permutations](./solutions/3343-count-number-of-balanced-permutations.js)|Hard|
 3344|[Maximum Sized Array](./solutions/3344-maximum-sized-array.js)|Medium|
+3353|[Minimum Total Operations](./solutions/3353-minimum-total-operations.js)|Easy|
 3355|[Zero Array Transformation I](./solutions/3355-zero-array-transformation-i.js)|Medium|
 3356|[Zero Array Transformation II](./solutions/3356-zero-array-transformation-ii.js)|Medium|
 3362|[Zero Array Transformation III](./solutions/3362-zero-array-transformation-iii.js)|Medium|
diff --git a/solutions/3353-minimum-total-operations.js b/solutions/3353-minimum-total-operations.js
@@ -0,0 +1,32 @@
+/**
+ * 3353. Minimum Total Operations
+ * https://leetcode.com/problems/minimum-total-operations/
+ * Difficulty: Easy
+ *
+ * Given an array of integers nums, you can perform any number of operations on this array.
+ *
+ * In each operation, you can:
+ * - Choose a prefix of the array.
+ * - Choose an integer k (which can be negative) and add k to each element in the chosen prefix.
+ *
+ * A prefix of an array is a subarray that starts from the beginning of the array and extends to
+ * any point within it.
+ *
+ * Return the minimum number of operations required to make all elements in arr equal.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minOperations = function(nums) {
+  let result = 0;
+
+  for (let i = 1; i < nums.length; i++) {
+    if (nums[i] !== nums[i - 1]) {
+      result++;
+    }
+  }
+
+  return result;
+};
