Solution: Find the K-Sum of an Array

Explore how to find the kth largest subsequence sum of an array by transforming the problem into identifying the smallest loss using a min heap. Learn to efficiently compute this result by sorting absolute values and using heap operations, enhancing your problem-solving skills for coding interviews and real-world scenarios.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are given an integer array, nums, and a positive integer k. Your task is to determine and return the $k^{th}$ largest possible sum among all subsequences of the array. A subsequence is formed by deleting no or more elements from the array without changing the order of the remaining elements. The sum of a subsequence is the total of its elements.

Remember: For valid subsequences:
The empty subsequence is valid, and its sum is considered $0$ .
Duplicate subsequence sums are allowed and counted separately when determining the $k^{th}$ largest.

Constraints:

$n ==$ nums.length
$1 \leq$ n $\leq 10^3$
$-10^3 \leq$ nums[i] ...