Debugging Go WaitGroups | Dataford Interview Questions

Describe a time you had to debug Go code using waitgroups.

For this coding exercise, analyze an abstract event trace and return the first detected issue. Events are ['Add', n], ['Done'], ['WaitStart'], or ['WaitEnd']. Return "ok", "negative-counter", "add-during-wait", or "deadlock".

The input is a list of event arrays. Add increases the counter, Done decreases it, and WaitEnd is valid only after a started wait observes a zero counter. An Add during an active wait is invalid.

Constraints

1 <= len(events) <= 1000
Each event is one of ['Add', n], ['Done'], ['WaitStart'], or ['WaitEnd']
0 <= n <= 1000
Return the first issue in trace order

Function Signature

def analyze_waitgroup_events(events):

Your question is Debugging Go WaitGroups. 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

Describe a time you had to debug Go code using waitgroups.

Constraints

1 <= len(events) <= 1000
Each event is one of ['Add', n], ['Done'], ['WaitStart'], or ['WaitEnd']
0 <= n <= 1000
Return the first issue in trace order

Function Signature

def analyze_waitgroup_events(events):

Your question is Debugging Go WaitGroups. 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.