Tap here to switch tabs
Problem
Submissions

Problem: Unique Middle Element

Unique Middle Element asks you to determine whether the middle value in an odd-length integer array appears exactly once, returning true if it is unique and false otherwise.

Statement

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 11 time in nums, and false otherwise.

Constraints:

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

  • n is odd.

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

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Unique Middle Element

Unique Middle Element asks you to determine whether the middle value in an odd-length integer array appears exactly once, returning true if it is unique and false otherwise.

Statement

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 11 time in nums, and false otherwise.

Constraints:

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

  • n is odd.

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