Beats 100% ✅✅ Easy Solution, Sorting Approach.
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  public int findValueOfPartition(int[] nums) {\n    int n = nums.length, ans = Integer.MAX_VALUE;\n    Arrays.sort(nums);\n    \n    for (var i=0; i < n-1; i++)\n      ans = Math.min(ans, nums[i+1] - nums[i]);\n    \n    return ans;\n  }\n}\n```
['Java']