Camelcase Matching

Solve Camelcase Matching.

Difficulty

medium

Companies

GoogleAmazonMicrosoftMetaTwitter

Topic

Trietrie trie-string-matching

Examples

Input: []

Output: 0

Input: ["a"]

Output: 0

Hints

A word matches if every uppercase letter appears at the same position in the pattern.

Iterate through both strings simultaneously, advancing only when there's a match.

Remaining characters in the query must all be lowercase.

Related Problems

implement-trie-prefix-tree

Camelcase Matching

Solve **Camelcase Matching**. This entry was scaffolded in Trie Mastery migration and should be refined with full statement/examples.