longest-common-prefix-after-at-most-one-removal.py

# Time:  O(n)
# Space: O(1)

# two pointers
class Solution(object):
    def longestCommonPrefix(self, s, t):
        """
        :type s: str
        :type t: str
        :rtype: int
        """
        result = i = j = 0
        removed = False
        while i < len(s) and j < len(t):
            if s[i] == t[j]:
                result += 1
                i += 1
                j += 1
            elif not removed:
                removed = True
                i += 1
            else:
                break
        return result