Flexport OA 2025 | Cheapest Route with K Stops

Problem 1 - Supply Chain Carrier Routing Optimization Engine Problem Statement You are building the core execution engine for an international shipping coordinator. The global freight network is modeled as a directed graph of logistics hubs labeled from 0 to N - 1. You are given a 2D integer array flights where: flights[i] = [from, to, price] indicates a direct cargo route from hub from to hub to with transportation cost price. Your task is to find the minimum transportation ...