Solution: Find the K-Sum of an Array

Explore how to efficiently find the k-th largest subsequence sum in an integer array by transforming the problem into a heap-based loss minimization approach. Learn to handle positive and negative values, understand subsequence sums, and apply sorting and min heaps to compute results with optimized time and space complexity.

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 ...