This is my first blog post. I have been thinking about writing for a long time but could not get an idea about what to write. Thus today after a lot a thought, I am writing about Regular Expression matcher using C++, one of the very famous questions on leetcode. This solution uses the Dynamic Programming approach.

The problem statement:

This article is going to be about the wildcard matching problem on leetcode. Just like my previous blog, the approach I will use to solve this problem will be Dynamic Programming.

The problem statement:

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where:

Example testcases from leetcode

The Approach:

If you have solved the regular expression problem on leetcode, you will have no difficulty in understanding the solution to this…

vatsal sinha

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store