Practice Find and Replace Pattern

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

Medium#890

LeetCode Problem

Find and Replace Pattern

Array Hash Table String

Problem Statement

Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order. A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the desired word. Recall that a permutation of letters is a bijection from letters to letters: every letter maps to another letter, and no two letters map to the same letter.

Source: Find and Replace Pattern on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"

Output

["mee","aqq"]

# Example 2

Input

words = ["a","b","c"], pattern = "a"

Output

["a","b","c"]

Constraints

1 <= pattern.length <= 20

1 <= words.length <= 50

words[i].length == pattern.length

pattern and words[i] are lowercase English letters.

Review your practice with PhantomCodeAI

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

Start Free