You are viewing a single comment's thread. Return to all comments →
I struggled with this one but I finally got it. Celebrating now.
def lonelyinteger(a): b = sorted(a) for i in range(0, len(b)-1, 2): if b[i] != b[i+1]: return b[i] return b[-1]
Seems like cookies are disabled on this browser, please enable them to open this website
Lonely Integer
You are viewing a single comment's thread. Return to all comments →
My Python Solution
I struggled with this one but I finally got it. Celebrating now.