2170. Minimum Operations to Make the Array Alternating: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1640,3 +1640,4 @@ mod s2165_smallest_value_of_the_rearranged_number;
 mod s2166_design_bitset;
 mod s2167_minimum_time_to_remove_all_cars_containing_illegal_goods;
 mod s2169_count_operations_to_obtain_zero;
+mod s2170_minimum_operations_to_make_the_array_alternating;

src/solution/s2170_minimum_operations_to_make_the_array_alternating.rs

@@ -0,0 +1,76 @@
+/**
+ * [2170] Minimum Operations to Make the Array Alternating
+ *
+ * You are given a 0-indexed array nums consisting of n positive integers.
+ * The array nums is called alternating if:
+ *
+ * 	nums[i - 2] == nums[i], where 2 <= i <= n - 1.
+ * 	nums[i - 1] != nums[i], where 1 <= i <= n - 1.
+ *
+ * In one operation, you can choose an index i and change nums[i] into any positive integer.
+ * Return the minimum number of operations required to make the array alternating.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [3,1,3,2,4,3]
+ * Output: 3
+ * Explanation:
+ * One way to make the array alternating is by converting it to [3,1,3,<u>1</u>,<u>3</u>,<u>1</u>].
+ * The number of operations required in this case is 3.
+ * It can be proven that it is not possible to make the array alternating in less than 3 operations.
+ *
+ * Example 2:
+ *
+ * Input: nums = [1,2,2,2,2]
+ * Output: 2
+ * Explanation:
+ * One way to make the array alternating is by converting it to [1,2,<u>1</u>,2,<u>1</u>].
+ * The number of operations required in this case is 2.
+ * Note that the array cannot be converted to [<u>2</u>,2,2,2,2] because in this case nums[0] == nums[1] which violates the conditions of an alternating array.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= nums.length <= 10^5
+ * 	1 <= nums[i] <= 10^5
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/
+// discuss: https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn minimum_operations(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2170_example_1() {
+        let nums = vec![3, 1, 3, 2, 4, 3];
+
+        let result = 3;
+
+        assert_eq!(Solution::minimum_operations(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2170_example_2() {
+        let nums = vec![1, 2, 2, 2, 2];
+
+        let result = 2;
+
+        assert_eq!(Solution::minimum_operations(nums), result);
+    }
+}