← All problemsSign in

3866. First Unique Even Element

LeetCodeArrayHash TableCountingOpen on judge ↗

You are given an integer array nums. Return an integer denoting the first even integer (earliest by array index) that appears exactly once in nums. If no such integer exists, return -1. An integer x is considered even if it is divisible by 2. Example 1: Input: nums = [3,4,2,5,4,6] Output: 2 Explanation: Both 2 and 6 are even and they appear exactly once. Since 2 occurs first in the array,

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start