You are given an integer array nums and an integer k.

You may choose at most $1$ element in a contiguous subarray and negate its value.

Return the maximum length of a subarray whose sum is divisible by k after applying at most $1$ negation. If no such subarray exists, return $0$.

Note: A subarray is a contiguous non-empty sequence of elements within an array.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

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

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

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.