✅✔️Short and Easy || C++ Solution || 100% Beat ✈️✈️✈️✈️✈️
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```\nclass Solution {\npublic:\n    int findValueOfPartition(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int mn = INT_MAX;\n        for(int i=1; i<nums.size(); i++){\n            if(nums[i] != nums[i-1]);\n            mn = min(mn, nums[i] - nums[i-1]);\n        }\n        return mn;\n    }\n};\n```
['Sorting', 'C++']