Regular Expression Matching at Google
Hard30.4% acceptance
This problem has 50.0% frequency at Google.
Problem Description
Given an input string `s` and a pattern `p`, implement regular expression matching with support for `'.'` and `'*'` where: * `'.'` Matches any single character. * `'*'` Matches zero or more of the preceding element. Return a boolean indicating whether the matching covers the entire input...
Read full problem and hintsTopics
Also asked at 26 companies
More Google Questions
Add Two NumbersMediumLongest Substring Without Repeating CharactersMediumLongest Common PrefixEasyTrapping Rain WaterHardMerge Strings AlternatelyEasy
View all Google questions