leetle

Daily challenge for 2026-09-24

632. Max Outgoing Route Capacity

You are given a positive integer n representing the number of transit stations labeled from 0 to n - 1, and a list of directed transmission links links, where each link is represented as a triple [u, v, capacity] indicating a directed connection from station u to station v carrying the specified non-negative integer capacity.

Return the maximum total outgoing capacity from any single transit station across all stations 0 to n - 1. If a station has no outgoing links, its total outgoing capacity is 0.

Example:
Input: n = 3, links = [[0, 1, 10], [0, 2, 5], [1, 2, 20]]
Output: 20

Run this challenge interactively in Python or JavaScript when the app loads.