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

An element is considered the majority element of a subarray of length $k$ if it appears strictly more than $\lfloor k / 2 \rfloor$ times in that subarray.

Return the total number of contiguous non empty subarrays of nums in which target is the majority element.

Constraints:

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

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

• $1 \leq$ target $\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.