Skip to content

Practice Camelcase Matching

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1023
LeetCode Problem

Camelcase Matching

ArrayTwo PointersStringTrieString Matching

Problem Statement

Given an array of strings queries and a string pattern, return a boolean array answer where answer[i] is true if queries[i] matches pattern, and false otherwise. A query word queries[i] matches pattern if you can insert lowercase English letters into the pattern so that it equals the query. You may insert a character at any position in pattern or you may choose not to insert any characters at all.

Source: Camelcase Matching on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FB"
Output
[true,false,true,true,false]

# Example 2

Input
queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBa"
Output
[true,false,true,false,false]

# Example 3

Input
queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBaT"
Output
[false,true,false,false,false]

Constraints

1 <= pattern.length, queries.length <= 100
1 <= queries[i].length <= 100
queries[i] and pattern consist of English letters.

Related LeetCode Problems

Practice more problems similar to Camelcase Matching.

14 Longest Common Prefix Easy5 Longest Palindromic Substring Medium11 Container With Most Water Medium15 3Sum Medium16 3Sum Closest Medium
← Previous Sum of Root To Leaf Binary NumbersNext → Video Stitching

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free