Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
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 1:
s = "aab", p = "cab"
Output 1: true
Input 2:
s = "mississippi", p = "misisp*."
Output 2: flase
Hey, I am Atul Kashyap, a GSSOC'21 participant.
I want to contribute the code for the implementation of the Regular Expression Matching in the C++ and Java language.
Please assign this task to me.
@anubhavitis @dheerajkotwani @tarun26091999 @todi-2000 @geekquad @plazzy99 @rudrakshi99
Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*' where:
The matching should cover the entire input string (not partial).
Input 1: s = "aab", p = "cab" Output 1: true
Input 2: s = "mississippi", p = "misisp*." Output 2: flase
Hey, I am Atul Kashyap, a GSSOC'21 participant. I want to contribute the code for the implementation of the Regular Expression Matching in the C++ and Java language. Please assign this task to me. @anubhavitis @dheerajkotwani @tarun26091999 @todi-2000 @geekquad @plazzy99 @rudrakshi99