Beats 100% One-Line Method
\n\n\n# Code\n\nvar findValueOfPartition = nums => Math.min(...nums.sort((a, b) => a - b).map((v, i, a) => a[i + 1] - v).slice(0, -1));\n\n\n##### please upvote
![image.png](https://assets.leetcode.com/users/images/66b6f7c1-d7f4-4d11-b804-0bcd10f0861c_1716108908.6692455.png)\n\n\n# Code\n```\nvar findValueOfPartition = nums => Math.min(...nums.sort((a, b) => a - b).map((v, i, a) => a[i + 1] - v).slice(0, -1));\n```\n\n##### please upvote, you motivate me to solve problems in original ways
['JavaScript']