Capitals Follow the Pattern

Medium

You get a list of CamelCase names names and a pattern string pattern. A name fits the pattern if it can be obtained from pattern by inserting only **lowercase** English letters anywhere (inserting nothing is allowed too). In other words, every letter of the pattern must appear in the name in the same order, and every other letter of the name must be lowercase. Return a list of booleans whose i-th element is True if names[i] fits the pattern and False otherwise.

Example 1

names=['GetUserName', 'GetUser', 'GoUpNow', 'getUserName'], pattern='GUN' → [True, False, True, False]

"GetUserName" and "GoUpNow" come from "GUN" by inserting lowercase letters. "GetUser" lacks the N, and "getUserName" has no capital G.

Example 2

names=['ReadFile', 'ReadFileSync', 'RedFox'], pattern='ReFi' → [True, False, False]

"ReadFileSync" has an extra capital S, which cannot be inserted. "RedFox" has no i after the F.

Constraints

1 ≤ len(pattern) ≤ 100
1 ≤ len(names) ≤ 100
1 ≤ len(names[i]) ≤ 100
names[i] and pattern consist of lowercase and uppercase English letters

Have you seen this problem in a real interview?

Solved by0

Tried by0

Submissions0

Acceptance—

Topics

Trie Array Two Pointers String String Matching

Similar problems

Highlight Search Hits Medium Highlight Search Terms Medium Target From Word Beginnings Medium Bookend Word Pairs Easy Framing Word Pairs Hard

Input

names=['GetUserName', 'GetUser', 'GoUpNow', 'getUserName'], pattern='GUN'

Expected

[True, False, True, False]

Run checks the first 3 tests in your browser. Submit checks all 105 tests on the server, hidden ones included.