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. Mars Exploration
  5. Discussions

Mars Exploration

  • geovanni_luna
     + 0 comments

    Python solution with O(n/3) time and O(1) time. I am not sure if there is a more efficient solution. If anyone can find something more efficient please comment:

    def marsExploration(s):
    i = 2
    res = 0
    while i < len(s):
        if s[i - 2] != 'S':
            res += 1
        if s[i - 1] != 'O':
            res += 1
        if s[i] != 'S':
            res += 1
            
        i += 3
    
    return res