Simple || Short || Clean || Java Solution
\njava []\nclass Solution {\n    public int findValueOfPartition(int[] nums) {\n        Arrays.sort(nums);\n        int min = Integer.MAX_VALUE;\n        for(in
\n```java []\nclass Solution {\n    public int findValueOfPartition(int[] nums) {\n        Arrays.sort(nums);\n        int min = Integer.MAX_VALUE;\n        for(int i=1; i<nums.length; i++){\n            min = Math.min(min,Math.abs(nums[i]-nums[i-1]));\n        }\n        return min;\n    }\n}\n```
['Java']