[LeetCode] Find All Lonely Numbers in the Array

2150. Find All Lonely Numbers in the Array

You are given an integer array nums. A number x is lonely when it appears only once, and no adjacent numbers (i.e. x + 1 and x - 1) appear in the array.

Return all lonely numbers in nums. You may return the answer in any order.

Read more
[AtCoder] E - 1 or 2Read more
[AtCoder] D - Even RelationRead more
[AtCoder] C - Dice and CoinRead more
[AtCoder] B - ABCRead more
[AtCoder] A - Kenken RaceRead more
[Codeforces] Round #196 (Div. 2) B. Routine ProblemRead more
[Codeforces] Flag DayRead more
[Codeforces] Round #208 (Div. 2) A. Dima and Continuous LineRead more
[Codeforces] Round #209 (Div. 2) B. PermutationRead more