Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
Debounce or Throttle Implementation
00:00
5 left

Debounce or Throttle Implementation

MediumPython

Problem

Braze Web SDK integrations may receive rapid browser events, such as clicks on a Braze In-App Message. Implement a deterministic simulator for either trailing-edge debouncing or leading-edge throttling without using timer libraries.

Given a nondecreasing list of event calls, return the calls that would invoke the wrapped callback.

Formal Specification

Implement rate_limit_events(calls, wait, mode), where calls is a list of [timestamp, value] pairs, wait is a positive integer number of milliseconds, and mode is either "debounce" or "throttle". Return a list of [timestamp, value] pairs representing callback invocations.

For debounce, each call cancels the previous pending invocation. The final call in a burst runs at last_call_timestamp + wait. A new call at exactly the scheduled invocation time is processed after the pending callback runs.

For throttle, the first call runs immediately. Later calls run only when at least wait milliseconds have elapsed since the previous invocation. Suppressed calls are discarded.

Constraints

  • 0 <= len(calls) <= 10^5
  • 0 <= calls[i][0] <= 10^9
  • Calls are sorted by nondecreasing timestamp.
  • 1 <= wait <= 10^9
  • Each event value is an integer or string.
  • mode is either "debounce" or "throttle".

Function Signature

def rate_limit_events(calls, wait, mode):
Interviewer

Your question is Debounce or Throttle 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.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.