Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1810. Minimum Path Cost in a Hidden Grid
You must navigate and discover a hidden grid using only local movement/cost queries from a start cell, reconstructing reachable cells and obstacles as you explore, then compute the minimum total cost to reach the target via adjacent moves. The core challenge is combining exploration of an unknown graph (limited visibility and queries) with a shortest-path algorithm (e.g., Dijkstra) on the discovered map.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.