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.
Loading...
  1. Practice
  2. Algorithms
  3. Strings
  4. Game of Thrones - I
  5. Discussions

Game of Thrones - I

  • __spartax + 2 comments
    from collections import Counter
print "YES" if len(filter(lambda x: x & 1, Counter(raw_input()).values())) <= 1 else "NO"
    • shankwiler + 1 comment

      similarly,

      s = input().strip()
if len([c for c in set(s) if s.count(c) % 2 != 0]) < 2:
    print('YES')
else:
    print('NO')
      • dm_dubovitsky + 1 comment

        you use set(s) in the loop, so it is unnessary work

        • erich_kramer1 + 1 comment

          Is it evaluated every

          • dm_dubovitsky + 0 comments

            Sure (has not), my bad

    • erich_kramer1 + 1 comment

      one line, can you golf it more? ;)

      return (sum(s.count(x)%2 for x in set(s) ) <2  and 'YES') or 'NO'
      • Widget + 0 comments

        Without using sets (and in Haskell, not Python):

        isAnaPalin = bool "YES" "NO" . (>1) . length . filter id . map (odd . length) . group . sort

        I'm sure it's possible to do a lot better than that though.