Leetcode 890. Find and Replace Pattern

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.
Input: words = ["a","b","c"], pattern = "a"
Output: ["a","b","c"]

--

--

--

CS new grad, 6 years experience related to supply chain management. Located in Bay area

Love podcasts or audiobooks? Learn on the go with our new app.

Game from scratch with C++ and SFML (4)

Linux GUI Application Support — Windows Subsystem For Linux

The power of Sprint Retrospective. Improve your organization by retro, no by the rules. |

Offensive Security Workshop: Why And How?

Latex Product ImprovePerformance https://t.co/PmUS1Y3nCc

JERITEX SYSTEM UPGRADE ANNOUNCEMENT

Co-Founder Series: Christina Zhu

Introduction to Git

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Gary Chiang

Gary Chiang

CS new grad, 6 years experience related to supply chain management. Located in Bay area

More from Medium

Leetcode 1514. Path with Maximum Probability

Count Binary Substrings

An Introduction to Linked Lists

All Possible Full Binary Trees Solution | LeetCode-894: Medium | JavaScript Implementation