5 lines python code | Simple method
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def findValueOfPartition(self, nums: List[int]) -> int:\n        n = len(nums)\n        nums.sort()\n        m=nums[-1]\n        for i in range(n-1):\n            m = min(nums[i+1]-nums[i],m)\n        return m\n```
['Sorting', 'Python3']