#Pathfinding

Explain why Dijkstra’s algorithm fails for certain scenarios and why the Bellman-Ford algorithm is preferable in those cases.

Discuss the algorithm to solve the problem of finding the cheapest flights within K stops and analyze its efficiency.

Given edges between countries and a list of banned countries, find the shortest path from the source to the destination while minimizing visits to banned countries.

Given a list of edges representing connections between countries (0 to n-1) and a list of banned countries that cannot be visited, find the shortest path from a specified source to a destination. Use BFS and keep track of previous countries.

Given a matrix, find the maximum sum path from top-left to bottom-right. You can only move right or down at any point in time. For example, given the matrix [[1, 2, 3], [4, 5, 6]], the maximum sum path is 1 → 2 → 5 → 6 = 14.