Key Press Buzzer Logic | Dataford Interview Questions

Write the logic for a key press buzzer implementation in an embedded system.

Implement key_press_buzzer(events, debounce_ms, beep_ms). Events are chronological dictionaries with timestamp, key, and boolean pressed fields. Return [start, end, key] intervals for every accepted press. A press is accepted when the key is currently released. A release is accepted only when the key has remained pressed for at least debounce_ms; shorter releases are treated as bounce. Duplicate events do not produce additional buzzer intervals.

Input: events is a list of dictionaries, and debounce_ms and beep_ms are non-negative integers. Output: a list of intervals in accepted event order.

Constraints

0 <= events.length <= 1000
Events are ordered by nondecreasing timestamp
Each event contains a string key and a boolean pressed value
0 <= timestamp, debounce_ms, beep_ms <= 10^9
A key's release may be reported multiple times during bounce

Function Signature

def key_press_buzzer(events, debounce_ms, beep_ms):

Your question is Key Press Buzzer Logic. 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

Write the logic for a key press buzzer implementation in an embedded system.

Input: events is a list of dictionaries, and debounce_ms and beep_ms are non-negative integers. Output: a list of intervals in accepted event order.

Constraints

0 <= events.length <= 1000
Events are ordered by nondecreasing timestamp
Each event contains a string key and a boolean pressed value
0 <= timestamp, debounce_ms, beep_ms <= 10^9
A key's release may be reported multiple times during bounce

Function Signature

def key_press_buzzer(events, debounce_ms, beep_ms):

Your question is Key Press Buzzer Logic. 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.