Find the Value of the Partition — LeetCode 2740 Python Solution

The problem

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.

Example

Input

nums = [1,3,2,4]

Output

1

Explanation

We can partition the array nums into nums1 = [1,2] and nums2 = [3,4].

Python solution

class Solution:
    def findValueOfPartition(self, nums: List[int]) -> int:
        nums.sort()
        return min(b - a for a, b in pairwise(nums))

Complexity

Pattern: Sorting

Spend O(n log n) once to buy an ordering that makes the rest of the problem trivial. LeetCode 2740. Find the Value of the Partition is filed here because LeetCode tags it Sorting, which is the vocabulary this hub collects.

The sorting guide has the Python template for the pattern and the 401 LeetCode problems that use it.

Related problems