_1133. Largest Unique Number.md

1133. Largest Unique Number

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : October 01, 2024

Last updated : October 01, 2024

---

Related Topics : Array, Hash Table, Sorting

Acceptance Rate : 70.6 %

---

Solutions

• e1133 inefficient oneliner.py
• e1133.py

Python

e1133 inefficient oneliner.py

# Slow but funny oneliner
class Solution:
    def largestUniqueNumber(self, nums: List[int]) -> int:
        return max(nums + [-1], key=lambda x: (-Counter(nums + [-1])[x], x))

e1133.py

class Solution:
    def largestUniqueNumber(self, nums: List[int]) -> int:
        nums.sort()

        while nums :
            curr = nums.pop()
            if not nums or nums[-1] != curr :
                return curr
            while nums and nums[-1] == curr :
                nums.pop()

        return -1