Easy | Beginner friendly | 4 lines code🤯 | Full explanation | Well commented | Line by line exp🔥
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
```cpp []
class Solution {
public:
    int findValueOfPartition(vector<int>& nums) {
        sort(nums.begin(),nums.end()); // sort the array
        int ans = INT_MAX; // set ans to max bcz we have to find min
        for(int i=1;i<nums.size();i++) ans=min(ans, nums[i]-nums[i-1]); 
// In a sorted array, the minimum possible partition difference will always be between two consecutive elements.
        return ans ;   
    }
};
```
['Greedy', 'Sorting', 'C++']