Problem #2740

Author: kulikov-dev

LeetCodeNet.Tests/Medium/Array/FindtheValueofthePartition_2740_test.cs

@@ -0,0 +1,45 @@
+using LeetCodeNet.Medium.Array;
+using System.Collections;
+
+namespace LeetCodeNet.Tests.Medium.Array
+{
+    public sealed class FindtheValueofthePartition_2740_test
+    {
+        [Theory, ClassData(typeof(FindtheValueofthePartitionTestData))]
+        public void Check(int[] inputData, int expected)
+        {
+            var solver = new FindtheValueofthePartition_2740();
+
+            Assert.Equal(expected, solver.MinPartitionValue(inputData));
+        }
+    }
+
+    public sealed class FindtheValueofthePartitionTestData : IEnumerable<object[]>
+    {
+        public IEnumerator<object[]> GetEnumerator()
+        {
+            yield return new object[]
+            {
+                new int[] {1,2,3,4},
+                1
+            };
+
+            yield return new object[]
+            {
+                new int[] {100, 1, 10},
+                9
+            };
+
+            yield return new object[]
+            {
+                new int[] {-2, -1, 10, 20 , 30},
+                1
+            };
+        }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            return GetEnumerator();
+        }
+    }
+}

LeetCodeNet/Medium/Array/FindtheValueofthePartition_2740.cs

@@ -0,0 +1,43 @@
+namespace LeetCodeNet.Medium.Array
+{
+    /// <summary>
+    /// https://leetcode.com/problems/find-the-value-of-the-partition/
+    /// </summary>
+    /// <remarks>
+    /// You are given a positive integer array nums.
+    /// Partition nums into two arrays, nums1 and nums2, such that:
+    /// Each element of the array nums belongs to either the array nums1 or the array nums2.
+    /// Both arrays are non-empty.
+    /// The value of the partition is minimized.
+    /// The value of the partition is |max(nums1) - min(nums2)|.
+    /// Here, max(nums1) denotes the maximum element of the array nums1, and min(nums2) denotes the minimum element of the array nums2.
+    /// Return the integer denoting the value of such partition.
+    /// </remarks>
+    internal sealed class FindtheValueofthePartition_2740
+    {
+        /// <summary>
+        /// The partition will be minimized when the two consecutive elements in the source array have the minimum difference.
+        /// This division will result in the first sub-array having the maximum value, and the following element will be the minimum of the next sub-array.
+        /// To apply this approach, we need to sort the source array first and then successively check two elements to find the minimum difference.
+        /// </summary>
+        /// <param name="nums"> Input data </param>
+        /// <returns> Min. number partition </returns>
+        /// <remarks>
+        /// Time complexity: O(n * log(n))
+        /// Space complexity: O(1)
+        /// </remarks>
+        public int MinPartitionValue(int[] nums)
+        {
+            System.Array.Sort(nums);
+
+            var minValue = int.MaxValue;
+
+            for (var i = 1; i < nums.Length; i++)
+            {
+                minValue = Math.Min(Math.Abs(nums[i] - nums[i - 1]), minValue);
+            }
+
+            return minValue;
+        }
+    }
+}

README.md

@@ -181,6 +181,7 @@ All problems are grouped by patterns, so you can train in solving of specific ty
 * #347: Top K Frequent Elements (Array)
 * #692: Top K Frequent Words (Array, Bucket)
 * #2300: Successful Pairs of Spells and Potions (Array)
+* #2740: Find the Value of the Partition (Array)
 #### Pattern: Binary search
 * #33: Search in Rotated Sorted Array (Array)
 * #34: Find First and Last Position of Element in Sorted Array (Array)