Python 3   ||   2 lines,  w/ explanation   ||   T/S: 93% / 98%
Here\'s the plan:\n\n- We sort the array to find the minimum difference between adjacent elements.\n\n- We calculate the minimum difference between adjacent ele
Here\'s the plan:\n\n- We sort the array to find the minimum difference between adjacent elements.\n\n- We calculate the minimum difference between adjacent elements in the sorted nums array using a generator expression.\n- We find the least difference, which represents the minimum absolute difference between the maximum element of `nums1 `and the minimum element of `nums2`.\n- We return the  minimum difference aas the answer to the problem. \n```\nclass Solution:\n    def findValueOfPartition(self, nums: List[int]) -> int:\n        \n        nums.sort()\n\n        return min(nums[i] - nums[i-1] for i in range(1,len(nums)))\n```\n[https://leetcode.com/problems/find-the-value-of-the-partition/submissions/1297175458/](https://leetcode.com/problems/find-the-value-of-the-partition/submissions/1297175458/)\n\nI could be wrong, but I think that time complexity is *O*(*N* log *N*) and space complexity is *O*(1), in which *N* ~`len(nums)`.
['Python3']