← Goldman Sachs questionsCount accepted strings of length L in a DFA
Filed under Goldman Sachs
Given a DFA (states, start, accept, transitions), calculate the number of distinct strings of length L that end in an accept state.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.
Related Goldman Sachs questions
Collected from public candidate posts and coding forums. Updated Nov 2026.