Given an integer array nums of odd length n, determine whether the middle element of nums is unique in the array.

Return true if the middle element appears exactly $1$ time in nums, and false otherwise.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 100$

• n is odd.

• $1 \leq$ nums[i] $\leq 100$

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.