Debounce Function from Scratch | Dataford Interview Questions

Implement a debouncing function from scratch

Asked in the coding stage. Implement trailing-edge debouncing using a deterministic event simulation rather than real timers.

Function Contract

Implement debounce(calls, wait, cancel_at). calls is a list of objects containing at, a nondecreasing timestamp, and args, a list of callback arguments. Each call replaces the previously pending call. Execute only the most recent call after wait time units without a newer call. If cancel_at is not null, cancel the pending call at that timestamp. Return the argument lists for callbacks that execute, in execution order. A cancellation does not prevent later calls from being scheduled.

Constraints

calls is a list of at most 10^4 call objects
Each call has an "at" number and an "args" list
Calls are sorted by nondecreasing "at"
0 <= wait <= 1000
cancel_at is null or a nonnegative number
The callback output is represented by the argument lists that execute

Function Signature

def debounce(calls, wait, cancel_at):

Your question is Debounce Function from Scratch. 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