Partition Value Finder

You are given a 0-indexed integer array nums. Partition it into two non-empty arrays such that every element belongs to exactly one part. The partition value is max(nums1) - min(nums2). Return the minimum possible partition value.

Examples
Input: [1,2,3,4]
Output: 1
Hints

Partition Value Finder

You are given a 0-indexed integer array nums. Partition it into two non-empty arrays such that every element belongs to exactly one part. The partition value is max(nums1) - min(nums2). Return the minimum possible partition value.