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
Compute Data Retrieval Efficiency
00:00
5 left

Compute Data Retrieval Efficiency

EasyPython

Problem

A mobile team at PulseApp logs each data retrieval attempt as the number of records fetched and the time taken in milliseconds. Write a function to calculate the application's retrieval efficiency, defined as the maximum whole-number rate of records / second across all valid attempts.

A retrieval attempt is valid only if its duration is greater than 0 milliseconds. For each valid attempt, compute:

efficiency = floor(records * 1000 / duration_ms)

Return the highest efficiency among all valid attempts. If there are no valid attempts, return 0.

Formal Specification

  • Input:
    • records: a list of non-negative integers where records[i] is the number of records fetched in attempt i
    • durations: a list of integers where durations[i] is the time in milliseconds for attempt i
  • Output:
    • An integer representing the maximum efficiency among all valid attempts

Constraints

  • 1 <= len(records) <= 10^5
  • len(records) == len(durations)
  • 0 <= records[i] <= 10^9
  • 0 <= durations[i] <= 10^9

Function Signature

def calculate_retrieval_efficiency(records, durations):
Interviewer

Your question is Compute Data Retrieval Efficiency. 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.