Given an integer array nums of size n, and two integers k and x, calculate the beauty of each subarray of size k.

The beauty of a subarray is defined as the $x^{ ext{th}}$ smallest negative integer in that subarray. If the subarray contains fewer than x negative integers, its beauty is $0$.

Return an integer array containing the beauty of each subarray of size k, ordered from the first subarray to the last.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ k $\leq$ n

• $1 \leq$ x $\leq$ k

• $-50 \leq$ nums[i] $\leq 50$

Input: nums = [4, -2, 7, -5, 0, -1]-List[int], k = 3-int, x = 2-int
Output: [0, -2, 0, -1]-List[int]
Explanation: The second smallest negative integer in each window is respectively unavailable, -2, unavailable, and -1, producing [0, -2, 0, -1].

Input: nums = [6, 8, 0, 3]-List[int], k = 4-int, x = 1-int
Output: [0]-List[int]
Explanation: The window contains no negative integers, so its beauty is 0.

Input: nums = [-10, -4, -7, -2]-List[int], k = 4-int, x = 3-int
Output: [-4]-List[int]
Explanation: The negative integers in sorted order are -10, -7, -4, and -2, so the third smallest negative integer is -4.

Input: nums = [-6, 5, -1, 9]-List[int], k = 1-int, x = 1-int
Output: [-6, 0, -1, 0]-List[int]
Explanation: Each window contains one element. The negative elements -6 and -1 produce those values, while the non-negative elements 5 and 9 produce 0.

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.