Beats 100% Runtime Solution Simple Sorting Java
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int findValueOfPartition(int[] nums) {
        int n=nums.length;
        Arrays.sort(nums);
        int minDiff=Integer.MAX_VALUE;
        for(int i=0;i<n-1;i++){
            minDiff=Math.min((nums[i+1]-nums[i]),minDiff);
        }
        return minDiff;
    }
}
```
['Java']