2567. Minimum Score by Changing Two Elements

LeetCodeArrayGreedySortingOpen on judge ↗

You are given an integer array nums. - The low score of nums is the minimum absolute difference between any two integers. - The high score of nums is the maximum absolute difference between any two integers. - The score of nums is the sum of the high and low scores. Return the minimum score after changing two elements of nums. Example 1: Input: nums = [1,4,7,8,5] Output: 3 Explanation:

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI