Java Solution || Beats 100%
# Code\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            int dif = nums[i]-nums[i-1];\n            if(dif<min){\n                min = dif;\n            }\n        }\n        return min;\n    }\n}\n```
['Java']