Given an integer array nums of length n and an integer k, return the $k^{ ext{th}}$ smallest subarray sum among all possible contiguous subarrays of nums.

A subarray is defined as a contiguous sequence of elements within an array. The sum of a subarray is the sum of all its elements.

Constraints:

• n == nums.length

• $1 \leq$ n $\leq 2 \cdot 10^4$

• $1 \leq$ nums[i] $\leq 5 \cdot 10^4$

• $1 \leq$ k $\leq$ n $\cdot ($ n $+ 1) / 2$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.