Leetcode Problem 291. Word Pattern II

291. Word Pattern II

Leetcode Solutions

Define a recursive function isMatch that takes the current index of s, the current index of pattern, the current mapping, and a set of already mapped strings.
If both the pattern and s are fully matched, return true.
If either the pattern or s is exhausted, return false.
Retrieve the current pattern character.
If the pattern character is already in the mapping, check if s starts with the mapped string at the current index. If it does, continue with the next characters.
If the pattern character is not in the mapping, try to map it to every possible non-empty substring of s that starts at the current index and has not been mapped to another character.
After each mapping, recursively call isMatch to continue with the next characters.
If the recursive call returns true, the current mapping leads to a solution, so return true.
If the mapping does not lead to a solution, backtrack by removing the current mapping and trying the next substring.
If no mapping leads to a solution, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen