Leetcode Problem 1023. Camelcase Matching

1023. Camelcase Matching

Leetcode Solutions

Two Pointer Approach

  1. Initialize an empty list result to store the boolean values for each query.
  2. Iterate over each query in the queries list.
  3. For each query, initialize two pointers: queryIndex and patternIndex both set to 0.
  4. Iterate over the characters in the query using queryIndex.
  5. If queryIndex and patternIndex point to matching characters, increment both pointers.
  6. If the character at queryIndex is an uppercase letter and does not match the character at patternIndex, break the loop and mark the query as not matching.
  7. If the character at queryIndex is a lowercase letter, only increment queryIndex.
  8. After the loop, if patternIndex is equal to the length of the pattern, it means all characters in the pattern were matched, so the query matches the pattern. Add true to result.
  9. Otherwise, add false to result.
  10. Return the result list.
UML Thumbnail

Filter and Check Subsequence Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...