simple and easy O(N) 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\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        nums.sort()\n        res = float(\'inf\')\n\n        for i in range(0, len(nums) - 1):\n            res = min(res, nums[i + 1] - nums[i])\n        \n        return res\n```
['Array', 'Sorting', 'Python3']