An array A is said to be larger than an array B of the same length if, at the first index i where A[i] \neq B[i], the element A[i] is strictly greater than B[i].

Given an integer array nums composed of unique integers and an integer k, return the largest subarray of nums having a length of k.

Constraints:

• $1 \leq k \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• All integers in nums are unique.

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.