Minimum Number of Operations to Make Array Continuous

CMakeLists.txt

@@ -356,6 +356,7 @@ add_task(minimum-number-of-arrows-to-burst-balloons)
 add_task(minimum-number-of-days-to-make-m-bouquets)
 add_task(minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix)
 add_task(minimum-number-of-increments-on-subarrays-to-form-a-target-array)
+add_task(minimum-number-of-operations-to-make-array-continuous)
 add_task(minimum-number-of-taps-to-open-to-water-a-garden)
 add_task(minimum-number-of-vertices-to-reach-all-nodes)
 add_task(minimum-one-bit-operations-to-make-integers-zero)

solutions/minimum-number-of-operations-to-make-array-continuous/CMakeLists.txt

@@ -0,0 +1 @@
+add_catch(test_minimum_number_of_operations_to_make_array_continuous test.cpp)

solutions/minimum-number-of-operations-to-make-array-continuous/solution.hpp

@@ -0,0 +1,21 @@
+#pragma once
+
+#include <algorithm>
+#include <vector>
+
+class Solution {
+public:
+  static int minOperations(std::vector<int> nums) {
+    const auto n = nums.size();
+
+    std::sort(nums.begin(), nums.end());
+    nums.erase(std::unique(nums.begin(), nums.end()), nums.end());
+
+    auto ans = n - 1;
+    for (auto it = nums.begin(); it != nums.end(); ++it) {
+      auto ub = std::upper_bound(it, nums.end(), *it + n - 1);
+      ans = std::min(ans, n - std::distance(it, ub));
+    }
+    return ans;
+  }
+};

solutions/minimum-number-of-operations-to-make-array-continuous/test.cpp

@@ -0,0 +1,18 @@
+#include <catch.hpp>
+
+#include <solution.hpp>
+
+TEST_CASE("Simple") {
+  {
+    std::vector<int> nums{4, 2, 5, 3};
+    REQUIRE(0 == Solution::minOperations(nums));
+  }
+  {
+    std::vector<int> nums{1, 2, 3, 5, 6};
+    REQUIRE(1 == Solution::minOperations(nums));
+  }
+  {
+    std::vector<int> nums{1, 10, 100, 1000};
+    REQUIRE(3 == Solution::minOperations(nums));
+  }
+}