Given an integer array nums sorted in non decreasing order and an integer target, return true if target is a majority element of nums, or false otherwise.

A majority element is an element that appears strictly more than nums.length $/ 2$ times in the array.

Constraints:

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

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

• nums is sorted in non decreasing order.

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.