Algorithm · Confluent · Medium
Note: During an interview, it is recommended to solve this problem using a two-pointer approach rather than dynamic programming. Problem Statement You are given an input string s and a pattern p. Implement wildcard pattern matching where the '' character can match any sequence of characters (including an empty sequence). The match must cover the entire input string s — partial matches are not allowed. Constraints: 0 <= s.length, p.length <= 2000 s contains only lowercase…
Checking your access…