Given an integer array nums and an integer k, return the maximum length of a contiguous subarray in nums whose elements sum to exactly k. If no such subarray exists, return $0$.

Note: A subarray is a contiguous sequence of elements within nums.

Constraints:

• $1 \leq$ nums.length $\leq 2 \cdot 10^5$

• $-10^4 \leq$ nums[i] $\leq 10^4$

• $-10^9 \leq$ k $\leq 10^9$

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.