Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ghusbands
on April 12, 2023
|
parent
|
context
|
favorite
| on:
On a great interview question
They are completely correct. If the DFA fits in RAM, following state transitions will be O(1) and using the DFA for a concatenated string of length N will be O(N). You simply missed a good solution.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
