Super Easy and Short solution C#
\n# Complexity\n- Time complexity: O(N log N)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n
\n# Complexity\n- Time complexity: O(N log N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```csharp []\npublic class Solution {\n    public int FindValueOfPartition(int[] nums) {\n        Array.Sort(nums);\n        int min = int.MaxValue;\n        for(int i = 1; i < nums.Length; i++)\n        {\n            min = Math.Min(nums[i] - nums[i - 1], min);\n        }\n        return min;\n    }\n}\n```\n![89f26eaf70fa927a79d4793441425859.jpg](https://assets.leetcode.com/users/images/3a039bea-35d8-4f67-90bf-09feae96e736_1731677534.3016534.jpeg)\n
['C#']