Regular Expression Matching Dynamic Programming | Leetcode Hard Solutions

Published: 01 January 1970
on channel: Pepcoding

53,425

1.9k

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this problem, we discuss the Regex Matching problem using dynamic programming. In this problem,

1. You are given two strings S1 and S2. S1 represents a text and S2 represents a pattern.
2. You have to print 'true' if the pattern is matched with the given text, otherwise print 'false'.

The pattern can include the characters '.' and '*'
'.' - matches any single character
'*' - matches zero or more of the preceding character

To attempt and submit this problem, click here: https://www.pepcoding.com/resources/d...

For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/o...
#dynamicprogramming #leetcode

Have a look at our result: https://www.pepcoding.com/placements
Follow us on our FB page:   / pepcoding
Follow us on Instagram:   / pepcoding
Follow us on LinkedIn:   / pepcoding-education