Easy c++ Solution
\n\n# Complexity\n- Time complexity: O(n logn)\n\n- Space complexity: O(1)\n\n# Code\n\nclass Solution {\npublic:\n    int findValueOfPartition(vector<int>& num
\n\n# Complexity\n- Time complexity: O(n logn)\n\n- Space complexity: O(1)\n\n# Code\n```\nclass Solution {\npublic:\n    int findValueOfPartition(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n\n        int mini = INT_MAX;\n        for(int i=0; i<nums.size()-1; i++){\n            mini = min(mini,nums[i+1]-nums[i]);\n        }\n\n        return mini;\n    }\n};\n```
['Array', 'C++']