Leetcode 890. Find and Replace Pattern || Medium
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.
Example 1:
Input: words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"
Output: ["mee","aqq"]
Explanation: "mee" matches the pattern because there is a permutation {a - m, b - e, ...}.
"ccc" does not match the pattern because {a - c, b - c, ...} is not a permutation, since a and b map to the same letter.
Example 2:
Input: words = ["a","b","c"], pattern = "a"
Output: ["a","b","c"]
Link to challenge: https://leetcode.com/problems/find-an...
On this page of the site you can watch the video online Leetcode 890. Find and Replace Pattern || Medium with a duration of hours minute second in good quality, which was uploaded by the user Code with Alisha 21 May 2021, share the link with friends and acquaintances, this video has already been watched 6,237 times on youtube and it was liked by 179 viewers. Enjoy your viewing!
