✅ 2 line solution ✅ Beats 100% ✅
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```java []\nclass Solution {\n    public int findValueOfPartition(int[] nums) {\n        Arrays.sort(nums);\n        int minDiff = nums[1] - nums[0];\n        for(int i = 2; i < nums.length; i++){\n            minDiff = Math.min(nums[i] - nums[i - 1], minDiff);\n        }\n        return minDiff;\n    }\n}\n```
['Sorting', 'Java']