Python O(nlogn) Time, O(n) Spacea
Complexity\n- Time complexity: O(nlogn) \n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(n)\n Add your space complexity here, e.g. O(n) \n\
# Complexity\n- Time complexity: $$O(nlogn)$$ \n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python []\nclass Solution(object):\n    def findValueOfPartition(self, nums):\n        """\n        :type nums: List[int]\n        :rtype: int\n        """\n        nums.sort()\n        return min( nums[idx]-nums[idx-1] for idx in range(1,len(nums)))\n```
['Python']