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
Build Data Structures Under Time Pressure
00:00
5 left

Build Data Structures Under Time Pressure

MediumPython

Problem

Pinterest Search needs to return up to k autocomplete suggestions for a lowercase prefix. Given a collection of searchable terms, build a trie and return the matching terms in lexicographic order.

Implement autocomplete(words, prefix, k). Each term may be inserted once, and suggestions must contain complete terms that start with prefix. Return fewer than k terms when fewer matches exist.

Formal Specification

  • Input: words, a list of lowercase strings; prefix, a lowercase string; and k, a positive integer.
  • Output: A list of at most k distinct strings beginning with prefix, sorted in lexicographic order.
  • The input terms are unique and contain only characters from a through z.

Constraints

  • 1 <= len(words) <= 10^5
  • 1 <= len(word) <= 50
  • 0 <= len(prefix) <= 50
  • 1 <= k <= 100
  • Words contain only lowercase English letters
  • The input terms are unique
  • The total number of characters across all words is at most 5 * 10^5

Function Signature

def autocomplete(words, prefix, k):
Interviewer

Your question is Build Data Structures Under Time Pressure. 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.