Beats 95% in time complexity, simple and understandable
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)$$ -->\no(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n log n)\n# Code\n```csharp []\npublic class Solution {\n    public int FindValueOfPartition(int[] nums) {\n        Array.Sort(nums);\n        int lowest = Math.Abs(nums[0] - nums[1]);\n        for (int i = 0; i < nums.Length - 1; i++){\n            if(Math.Abs(nums[i] - nums[i + 1]) < lowest){\n                lowest = Math.Abs(nums[i] - nums[i + 1]);\n            }\n        }\n        return lowest;\n    }\n}\n```
['C#']