Exercises/#141 Regular Expression Matching
#141

Regular Expression Matching

Hard🧩 Dynamic Programming
150 XP

Problem

Implement regular expression matching with '.' (any single character) and '' (zero or more of preceding element).

Examples

Input: s='aa', p='a*'
Output: true

Input: s='ab', p='.*'
Output: true

Input: s='aab', p='c*a*b'
Output: true
dynamic-programmingstringrecursion
AI Assistantβ€” powered by AI

Unlock hints progressively β€” start gentle, go deeper only if needed.

πŸ’‘

Level 1: Gentle Nudge

A subtle direction

πŸ—ΊοΈ

Level 2: Approach

The algorithm to use

πŸ”

Level 3: Detailed

Step-by-step guidance

141 / 150

Your Solution

⚑ JavaScript
Loading...

to save progress and use AI features