LC-1023 Medium LeetCode

1023. Camelcase Matching

Array Two Pointers String Trie String Matching

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 64% Topics: Array, Two Pointers, String, Trie, String Matching

Reading material

Arrays & Hashing 12 min Two Pointers 9 min Strings 12 min

Reference solution (spoiler · python)

# Time:  O(n * l), n is number of quries
#                , l is length of query
# Space: O(1)

class Solution(object):
    def camelMatch(self, queries, pattern):
        """
        :type queries: List[str]
        :type pattern: str
        :rtype: List[bool]
        """
        def is_matched(query, pattern):
            i = 0
            for c in query:
                if i < len(pattern) and pattern[i] == c:
                    i += 1
                elif c.isupper():
                    return False
            return i == len(pattern)
        
        result = []
        for query in queries:
            result.append(is_matched(query, pattern))
        return result

Solution from kamyu104/LeetCode-Solutions · MIT