Regular Expression Matching Leetcode Python Solution

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Regular Expression Matching Leetcode Python”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE.

Question
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).
Examples
Input: s = "aa", p = "a"
Output: false
Explanation: "a" does not match the entire string "aa".
Input: s = "aa", p = "a*"
Output: true
Explanation: '' means zero or more of the preceding element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".
Input: s = "ab", p = "."
Output: true
Explanation: "." means "zero or more () of any character (.)".
Constraints:
1 <= s.length <= 20
1 <= p.length <= 30
s contains only lowercase English letters.
p contains only lowercase English letters, '.', and ''.
It is guaranteed for each appearance of the character '', there will be a previous valid character to match.
Solution to Regular Expression Matching Leetcode Python
The Solution to the problem in python is here https://hecodesit.com/regular-expression-matching-leetcode-python-solution/