LeetCode Daily Challenge-2163: Minimum Difference in Sums After Removal of Elements(Hard, Java, DP+priorityQueue+greedy)

Problem Statement LeetCode 2163: Minimum Difference in Sums After Removal of Elements Difficulty: Hard Topics: Array, Dynamic Programming, Heap (Priority Queue) Date: 18 July 2025 You are given a 0-indexed integer array nums consisting of 3 * n el...