2163. Minimum Difference in Sums After Removal of Elements

LeetCodeArrayDynamic ProgrammingHeap (Priority Queue)Open on judge ↗

You are given a 0-indexed integer array nums consisting of 3 * n elements. You are allowed to remove any subsequence of elements of size exactly n from nums. The remaining 2 * n elements will be divided into two equal parts: - The first n elements belonging to the first part and their sum is sumfirst. - The next n elements belonging to the second part and their sum is sumsecond. The difference

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