Leetcode 2150. Find All Lonely Numbers in the Array

Find all integers that occur exactly once in nums and whose immediate neighbors (x-1 and x+1) do not appear in the array; return these "lonely" numbers in any order.

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 2150. Find All Lonely Numbers in the Array

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact