Pregunta de entrevista de Uber
Given a regular expression pattern and a string, check to see if pattern matches the string.
Respuestas de entrevistas
Anónimo
8 dic 2015
#1: generate a non-finite automaton (NFA) from the regular expression. #2: convert NFA to Deterministic finite automaton (DFA) #3: run string through DFA to see if there is a match