Skip to content
LEETFLIX

method

Shortest Path — animated LeetCode walkthroughs

LeetCode problems solved with Shortest Path. Browse the complete tag, then watch the algorithm move — step-by-step animation, Python and Go.

43 problems · 35 animated · 8 locked

Full Shortest path index

  1. 399Evaluate DivisionWatch
  2. 499The Maze IIILocked
  3. 505The Maze IILocked
  4. 743Network Delay TimeWatch
  5. 787Cheapest Flights Within K StopsWatch
  6. 882Reachable Nodes In Subdivided GraphWatch
  7. 1334Find the City With the Smallest Number of Neighbors at a Threshold DistanceWatch
  8. 1368Minimum Cost to Make at Least One Valid Path in a GridWatch
  9. 1514Path with Maximum ProbabilityWatch
  10. 1786Number of Restricted Paths From First to Last NodeWatch
  11. 1810Minimum Path Cost in a Hidden GridLocked
  12. 1976Number of Ways to Arrive at DestinationWatch
  13. 2045Second Minimum Time to Reach DestinationWatch
  14. 2093Minimum Cost to Reach City With DiscountsLocked
  15. 2203Minimum Weighted Subgraph With the Required PathsWatch
  16. 2290Minimum Obstacle Removal to Reach CornerWatch
  17. 2297Jump Game VIIILocked
  18. 2473Minimum Cost to Buy ApplesLocked
  19. 2577Minimum Time to Visit a Cell In a GridWatch
  20. 2642Design Graph With Shortest Path CalculatorWatch
  21. 2662Minimum Cost of a Path With Special RoadsWatch
  22. 2699Modify Graph Edge WeightsWatch
  23. 2714Find Shortest Path with K HopsLocked
  24. 2737Find the Closest Marked NodeLocked
  25. 2959Number of Possible Sets of Closing BranchesWatch
  26. 2976Minimum Cost to Convert String IWatch
  27. 2977Minimum Cost to Convert String IIWatch
  28. 3112Minimum Time to Visit Disappearing NodesWatch
  29. 3123Find Edges in Shortest PathsWatch
  30. 3286Find a Safe Walk Through a GridWatch
  31. 3341Find Minimum Time to Reach Last Room IWatch
  32. 3342Find Minimum Time to Reach Last Room IIWatch
  33. 3377Digit Operations to Make Two Integers EqualWatch
  34. 3419Minimize the Maximum Edge Weight of GraphWatch
  35. 3594Minimum Time to Transport All IndividualsWatch
  36. 3604Minimum Time to Reach Destination in Directed GraphWatch
  37. 3620Network Recovery PathwaysWatch
  38. 3650Minimum Cost Path with Edge ReversalsWatch
  39. 3928Minimum Cost to Buy Apples IIWatch
  40. 3970Shortest Path With At Most K Consecutive Identical CharactersWatch
  41. 3977Minimum Time to Reach Target With Limited PowerWatch
  42. 4003Minimum Cost Path with Alternating Directions IIIWatch
  43. 4046Minimum Cost Path With At Most K TurnsWatch