Given an integer array nums of size n containing distinct integers, and an integer k, return the number of non-empty subarrays that have a median equal to k.

The median of an array is the middle element after sorting its elements in non-decreasing order. If the array contains an even number of elements, the median is defined as the left middle element (the element located at index $\lfloor (m - 1) / 2 \rfloor$ in the sorted array of length $m$, assuming $0$ based indexing).

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

Constraints:

• n $==$ nums.length

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

• $1 \leq$ nums[i], k $\leq$ n

• All integers in nums are distinct.

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.