Beats 98%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nThe problem seems to be
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nThe problem seems to be asking for the minimum difference between any two adjacent elements in a list of integers. Here\'s my approach to solving it:\n\nSort the list of integers in ascending order. This will allow us to easily compare adjacent elements.\nIterate through the sorted list, and for each pair of adjacent elements, compute their difference.\nKeep track of the minimum difference found so far.\nReturn the minimum difference.\n\n# Complexity\n- Time complexity: O(n log n)\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```\nclass Solution:\n    def findValueOfPartition(self, nums: List[int]) -> int:\n        nums.sort()\n        return min(nums[i] - nums[i-1] for i in range(1, len(nums)))\n\n```
['Python3']