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

  • 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.