Leetcode 1133. Largest Unique Number

Given an array of integers, find the largest value that appears exactly once; return -1 if no unique number exists. This requires counting frequencies (e.g., using a hash map) and selecting the maximum element with frequency one.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1133. Largest Unique Number

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact