6890. Find the Value of the Partition || Leetcode solution

code in the comment section...

[ahmedberuny-coding]

class Solution {
public:
int nums) {
sort(nums.begin(), nums.end());

int ans = INT_MAX;
for(int i = 1;i<nums.size();i++){
ans = min(ans, nums[i]-nums[i-1]);
}

return ans;
}
};