☕Java☕ ✅✅simple solution🔥🔥;
\n\n# Approach\n Describe your approach to solving the problem. \n\n\n# Code\n\nclass Solution {\n    public int findValueOfPartition(int[] nums) {\n        int
\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n\n# Code\n```\nclass Solution {\n    public int findValueOfPartition(int[] nums) {\n        int min = Integer.MAX_VALUE;\n        Arrays.sort(nums);\n        for(int i = 0; i < nums.length-1; i++){\n            if(nums[i+1] - nums[i] < min) min = nums[i+1] - nums[i];\n        }\n        return min;\n    }\n}\n```
['Java']