Simple Python Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n1. Sort the array in 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n1. Sort the array in incrasing order\n2. calculate absolute difference between two numbers\n3. find the min of all the abs values\n\n# Complexity\n- Time complexity:  O(N LogN)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def findValueOfPartition(self, nums: List[int]) -> int:\n        nums.sort()\n        result = float(\'inf\')\n        for i in range(1,len(nums)):\n            result = min(result,nums[i]-nums[i-1])\n        \n        return result\n\n        \n```
['Python3']