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
Mouse and Valid Move API
00:00
5 left

Mouse and Valid Move API

MediumPython

Problem

Help a mouse find cheese given only an API that tells you whether a move is valid (no grid or coordinates)

Asked in the coding stage. Implement the search using only movement operations and cheese detection after the API is initialized from the test representation.

Input and Output

find_cheese(edges, start, cheese) receives directed movement records [from_node, direction, to_node], a starting node ID, and a list of cheese node IDs. Each listed move is reversible using the opposite direction. Return a list of direction strings leading to any cheese node, or None if no cheese is reachable. Valid directions are U, R, D, and L.

Constraints

  • Node IDs are non-empty strings.
  • Each direction is one of U, R, D, or L.
  • Each listed movement is reversible using the opposite direction.
  • The graph contains at most 10^4 nodes and 4 * 10^4 movement records.

Function Signature

def find_cheese(edges, start, cheese):
Interviewer

Your question is Mouse and Valid Move API. 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.