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
Efficient Algorithms Implementation
00:00
5 left

Efficient Algorithms Implementation

MediumPython

Problem

Akamai edge logic may need to detect a token in a request path before applying a Property Manager rule. Given a text string and a pattern string, return the index of the pattern's first occurrence in the text, or -1 if it does not occur.

Implement the search without using Python's built-in substring search methods. Your solution should preprocess the pattern so repeated prefixes are not rescanned.

Formal Specification

Implement find_token(text, pattern):

  • Input: two strings, text and pattern.
  • Output: an integer containing the smallest index where pattern begins in text, or -1 when no match exists.
  • An empty pattern should return 0, following standard substring-search conventions.

Constraints

  • 0 <= len(text) <= 10^6
  • 0 <= len(pattern) <= 10^5
  • Both strings contain ASCII characters
  • Return the first occurrence only
  • An empty pattern returns 0

Function Signature

def find_token(text, pattern):
Interviewer

Your question is Efficient Algorithms 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.