MakeMyTrip SDE-1 OA 2025 | Holiday Flight Network & Deepest Itinerary Anchor

Problem 1 - Holiday Flight Network Problem Statement You are building the backend logic for a flight recommendation engine. You are given N cities connected by flights. Each flight is represented as: [from, to, price] indicating a flight from city from to city to with cost price. A traveler wants to go from src to dst using at most K stops. Find the minimum possible travel cost. If no valid route exists, return -1. Constraints Constraint 1 ≤ N ≤ ...