Python Elegant & Short | One-Line | Pairwise + Sort
Complexity\n- Time complexity: O(n * \log_2 {n})\n- Space complexity: O(n)\n\n# Code\n\nclass Solution:\n    def findValueOfPartition(self, nums: List[int]) -> 
# Complexity\n- Time complexity: $$O(n * \\log_2 {n})$$\n- Space complexity: $$O(n)$$\n\n# Code\n```\nclass Solution:\n    def findValueOfPartition(self, nums: List[int]) -> int:\n        return min(y - x for x, y in pairwise(sorted(nums)))\n```
['Sorting', 'Python', 'Python3']