Table of Contents

## Find the K-Sum of an Array solution leetcode

**Find the K-Sum of an Array solution leetcode** – You are given an integer array `nums`

and a **positive** integer `k`

. You can choose any **subsequence** of the array and sum all of its elements together.

We define the **K-Sum** of the array as the `k`

^{th}**largest** subsequence sum that can be obtained (**not** necessarily distinct).

Return *the K-Sum of the array*.

A **subsequence** is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

**Note** that the empty subsequence is considered to have a sum of `0`

.

## Find the K-Sum of an Array solution leetcode

Input:nums = [2,4,-2], k = 5Output:2Explanation:All the possible subsequence sums that we can obtain are the following sorted in decreasing order: - 6, 4, 4, 2,2, 0, 0, -2. The 5-Sum of the array is 2.

## Find the K-Sum of an Array solution leetcode

Input:nums = [1,-2,3,4,-10,12], k = 16Output:10Explanation:The 16-Sum of the array is 10.

## Find the K-Sum of an Array solution leetcode

`n == nums.length`

`1 <= n <= 10`

^{5}`-10`

^{9}<= nums[i] <= 10^{9}`1 <= k <= min(2000, 2`

^{n})