Min consecutive value || Very simple and easy to understand solution
 Up vote if you like the solution\n\n# Approach\n- Sort the array\n- Now we can split the array in to part from the point where the two consicutive elemnts have
<b> Up vote if you like the solution</b>\n\n# Approach\n- Sort the array\n- Now we can split the array in to part from the point where the two consicutive elemnts have min difference. So the lower side array have max value and the next element is the min of the next upper side array section.\n- so keep iterating to get the min diff betteen two consicutive elements.\n\n# Code\n```\nint findValueOfPartition(vector<int>& nums) {\n    int ans = INT_MAX;\n    sort(nums.begin(), nums.end());\n    for(int i = 1; i < nums.size(); ++i) ans = min(ans, nums[i] - nums[i-1]);\n    return ans;\n}\n```\n<b>Here is an article of my recent interview experience at Amazon, you may like :\nhttps://leetcode.com/discuss/interview-experience/3171859/Journey-to-a-FAANG-Company-Amazon-or-SDE2-(L5)-or-Bangalore-or-Oct-2022-Accepted
['C++']