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
Implement an Algorithm in Python
00:00
5 left

Implement an Algorithm in Python

MediumPython

Problem

ZoomInfo Intent can receive company signals from multiple sources. Implement a function that combines these feeds, keeps the highest score for each company, and returns the k highest-ranked unique companies.

A company with a higher score ranks first. If two companies have the same score, the company with the smaller numeric ID ranks first.

Formal Specification

Implement top_k_companies(feeds, k), where feeds is a list of feeds and each feed is a list of records in the form [company_id, score]. company_id is an integer and score is an integer. Return a list of [company_id, best_score] records ordered by rank. Return at most k records.

The same company may occur in multiple feeds, and its score may differ between feeds. The output must contain each company at most once.

Constraints

  • 1 <= len(feeds) <= 10^4
  • The total number of records across all feeds is at most 10^6
  • 1 <= k <= 10^5
  • 1 <= company_id <= 10^9
  • 0 <= score <= 10^9

Function Signature

def top_k_companies(feeds, k):
Interviewer

Your question is Implement an Algorithm in Python. 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.