very very very very easy easy
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int findValueOfPartition(vector<int>& nums) {\n   int n = nums.size();\n\n  sort(nums.begin() , nums.end());\n\nint mx = INT_MAX;\n\n\nfor(int i =0; i<nums.size()-1; i++)\n{\nmx = min(mx,abs(nums[i] - nums[i+1]));\n\n}\n\n\n  return mx;     \n    }\n};\n```
['C++']