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

Game of Thrones - I

  • geovanni_luna
     + 0 comments

    Python solution O(n) time and O(k) space.

    k represent best case scenario worse case will be O(n) where every chars is added to the dictionary.

    def gameOfThrones(s):
    chars = {}

    for c in s:
        if c not in chars:
            chars[c] = 0

        if chars[c] > 0:
            chars[c] -= 1
        else:
            chars[c] += 1
            
    if sum(chars.values()) <= 1:
        return "YES"
    return "NO"