This tag doesn't have any usage information yet.
This tag doesn't have a detailed wiki yet.
In this challenge you will take a number $n$ and a string $X$ of length $\geq n$, and produce a regular expression which matches all strings that are withing $n$ character substitutions of $X$.
posted 3mo ago
· last activity
This community is part of the Codidact network.
We have other communities too — take a look!
You can also join us in chat!
Want to advertise this community? Use our templates!
Like what we're doing? Support us! Donate