Algorithm · Amazon · Hard
Regular Expression Matching Hard · Topics · Company Tags · Hints You are given a string s and a pattern p. Implement a regular expression matcher that determines whether p describes the entirety of s. The pattern supports these two special constructs: A period ('.') matches any single character. An asterisk ('') means zero or more copies of the character that appears immediately before it. The matching must cover the whole input string — partial matches should be rejected.…
Checking your access…