← Back to problem library
Problem detail
1631. Path With Minimum Effort
MediumArrayBinary SearchDepth-First SearchBreadth-First SearchUnion-FindHeap (Priority Queue)MatrixDijkstra's Algorithm
Use this page to open the original problem, record a review, and keep the reasoning you want to remember for the next attempt.
Review history
No review history yet. Record your first attempt after solving this problem.