Easy Solution
Complexity
Time complexity:
O(nlog(n))
Space complexity:
O(1)Code
# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
$$O(nlog(n))$$

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
$$O(1)$$

# Code
```python3 []
class Solution:
    def findValueOfPartition(self, nums: List[int]) -> int:
        nums.sort()
        delta = float('inf')

        for i in range(len(nums)-1):
            if nums[i+1]-nums[i] < delta:
                delta = nums[i+1]-nums[i]
        
        return delta

        
```
['Python3']