We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Lonely Integer
  2. Discussions

Lonely Integer

  • muhumukip
     + 0 comments

    Python 3 Solution.

    Using list comprehensions.

    • Time complexity of O(n^2)
    • Space Complexity of O(1)
    def lonelyinteger(a):
    loner = [value for value in a if a.count(value) == 1]
    return loner[0]