Shortest Path problems

21 Shortest Path DSA practice problems on CampusCode, each with statement, examples and constraints.

• 978. Find Shortest Path in Unweighted Graph Easy Graphs
• 1026. Dijkstra's Shortest Path Algorithm Medium Graphs
• 1027. Bellman-Ford Shortest Path Medium Graphs
• 1028. Shortest Path in DAG (Topo + Relax) Medium Graphs
• 1029. Floyd-Warshall All-Pairs Shortest Path Medium Graphs
• 1030. Dijkstra on Grid — Minimum Cost Path Medium Graphs
• 1031. Network Delay Time (Dijkstra) Medium Graphs
• 1032. Cheapest Flights Within K Stops Medium Graphs
• 1033. Path with Minimum Effort Medium Graphs
• 1034. Swim in Rising Water (Dijkstra / BS) Medium Graphs
• 1035. Find the City with Smallest Reachable Neighbours Medium Graphs
• 1070. Reachable Nodes in Subdivided Graph Medium Graphs
• 1073. Number of Ways to Arrive at Destination Medium Graphs
• 1074. Minimum Weighted Sum to All Reachable Nodes Medium Graphs
• 1076. Dijkstra with State — Minimum Cost with K Stops Hard Graphs
• 1077. Bellman-Ford — Detect Negative Weight Cycle Hard Graphs
• 1078. Johnson's Algorithm — All-Pairs on Sparse Graph Hard Graphs
• 1079. Minimum Cost Path with At Most K Edges (DP+Graph) Hard Graphs
• 1097. Number of Restricted Paths Hard Graphs
• 1345. Stickers to Spell Word — Bitmask DP Medium Bit Manipulation
• 1349. Minimum Cost to Visit Every Node (Bitmask TSP) Medium Bit Manipulation