Loading…
Regular Expression Matching is a hard coding interview question covering dynamic programming, strings — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
Implement regular expression matching with "." and "*": - "." matches any single character - "*" matches zero or more of the preceding element
Example: s="aab", p="c*a*b" -> true Example: s="aa", p="a" -> false (a matches only one a) Example: s="aa", p="a*" -> true
The match must cover the entire input string, not just a prefix.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.