Write a function that accepts a string and a regular expression, and return true if the string contains a match.
Anonymous
I constructed a deterministic finite automaton as a graph, with individual characters as nodes.
Check out your Company Bowl for anonymous work chats.