Given an integer array nums and an integer target, return the total number of contiguous subarrays in which target is the majority element.

Note: An element is considered the majority element of a subarray if it appears strictly more than half the total number of elements in that subarray.

Constraints:

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

• $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.