From 4e52d4194fe55ae0b9d4ecd040ea4a90aeb1b696 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=D0=9C=D0=BE=D1=80=D0=B5=D0=B2=20=D0=90=D0=BB=D0=B5=D0=BA?=
 =?UTF-8?q?=D1=81=D0=B0=D0=BD=D0=B4=D1=80?= <hikjik@yandex.ru>
Date: Tue, 10 Oct 2023 05:19:48 +0300
Subject: [PATCH] Minimum Number of Operations to Make Array Continuous

---
 CMakeLists.txt                                |  1 +
 .../CMakeLists.txt                            |  1 +
 .../solution.hpp                              | 21 +++++++++++++++++++
 .../test.cpp                                  | 18 ++++++++++++++++
 4 files changed, 41 insertions(+)
 create mode 100644 solutions/minimum-number-of-operations-to-make-array-continuous/CMakeLists.txt
 create mode 100644 solutions/minimum-number-of-operations-to-make-array-continuous/solution.hpp
 create mode 100644 solutions/minimum-number-of-operations-to-make-array-continuous/test.cpp

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 3afdabf3..7ca38038 100644
--- a/CMakeLists.txt
+++ b/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)
diff --git a/solutions/minimum-number-of-operations-to-make-array-continuous/CMakeLists.txt b/solutions/minimum-number-of-operations-to-make-array-continuous/CMakeLists.txt
new file mode 100644
index 00000000..f4ce77a9
--- /dev/null
+++ b/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)
diff --git a/solutions/minimum-number-of-operations-to-make-array-continuous/solution.hpp b/solutions/minimum-number-of-operations-to-make-array-continuous/solution.hpp
new file mode 100644
index 00000000..c632ce20
--- /dev/null
+++ b/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;
+  }
+};
diff --git a/solutions/minimum-number-of-operations-to-make-array-continuous/test.cpp b/solutions/minimum-number-of-operations-to-make-array-continuous/test.cpp
new file mode 100644
index 00000000..cf63da4b
--- /dev/null
+++ b/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));
+  }
+}