Skip to content

problem15.md

Latest commit

 

History

History
17 lines (14 loc) · 541 Bytes

problem15.md

File metadata and controls

17 lines (14 loc) · 541 Bytes

Problem 15: Nondeterministic Pattern Matcher (Regular Expression Matching)

Problem Statement

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. The matching should cover the entire input string (not partial).

Input Format

  • Input string s.
  • Pattern string p.

Example

Input: s = "aa", p = "a*"
Output: True Input: s = "ab", p = ".*"
Output: True