Skip to main content

Practice

Shortest Path Problem Set

⭐⭐ intermediate~50 min of coding5 challenges

Five problems: Dijkstra with unreachables, the standard pipeline, 0-1 BFS, plain BFS, and 0-1 BFS on a two-cluster state graph.

Checking your progress…0%

What you will practice

  1. Vé xe buýt⭐⭐ intermediate
  2. Giá vé âm?⭐⭐ intermediate
  3. Cửa miễn phí⭐⭐ intermediate
  4. BFS thuần — hằng số rẻ nhất⭐⭐ intermediate
  5. Nút bấm hai trạng thái⭐⭐ intermediate

Need the concept first? Re-read the lesson.