Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Grid Pathfinding with BFS/Dijkstra

Hard
CodingbfsGraphsHeap
Asked 1w ago|
Phonepe
Phonepe

Problem

Solve a path-finding problem on a grid using a modified Breadth-First Search (BFS) or Dijkstra's algorithm.

You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.

Sign up freeI have an account
Sign up to unlock solutions
Phonepe Software Engineer Interview Questions
Next questions
Samsung ElectronicsGrid Shortest Path with BFS/DFSHardAnakin (Yc S21)Grid Pathfinding with Graph TraversalHardRockstar GamesBFS Shortest Path in Dynamic GridMedium
0 / ~200 words