Problem intelligence

Minimum Cost to Make at Least One Valid Path in a Grid

HARD · 6 companies · 0-1 BFS · Array · Breadth-First Search · Dijkstra's Algorithm · Graph Theory · Heap (Priority Queue) · Matrix · Shortest Path

Interview priority

52

medium

Target overlap

0/0

Recency

30

Trend

50

Frequency

100

Company observations

Amazonolder8.9
Amazonall7.2
Cleartripolder100
Cleartripall100
Docusignolder70
Docusignall63.5
Googleolder26
Googleall31.1
Metaolder8.7
Metaall8
Uberolder49
Uberall44.8

Why this score

high frequency100
unsolved100

Local progress

unseen

Open on LeetCode