State Machine Implementation | Dataford Interview Questions

Write a function to implement a simple state machine. The function receives a transition map, an initial state, and an ordered list of events: def run_state_machine(transitions, initial_state, events):. For each event, move to the configured next state; if no transition exists for the current state and event, remain in the current state. Return the final state.

Constraints

1 <= number of states and transitions <= 10^4
0 <= len(events) <= 10^3
State and event names are hashable values
If a transition is missing, the machine remains in its current state

Function Signature

def run_state_machine(transitions, initial_state, events):

Your question is State Machine Implementation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= number of states and transitions <= 10^4
0 <= len(events) <= 10^3
State and event names are hashable values
If a transition is missing, the machine remains in its current state

Function Signature

def run_state_machine(transitions, initial_state, events):

Your question is State Machine Implementation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.