Daily challenge for 2026-09-25
633. Minimum In-Degree in Network
You are given a positive integer n representing the total number of servers numbered from 0 to n - 1, and a 2D array connections where each element [u, v] represents a directed communication link from server u to server v.
The in-degree of a server is the total number of incoming connections directed towards it. Return the minimum in-degree among all n servers in the network.
Example:
Input: n = 3, connections = [[0, 1], [1, 2], [0, 2]]
Output: 0
Explanation: Server 0 has 0 incoming connections, server 1 has 1, and server 2 has 2. The minimum in-degree is 0.
Run this challenge interactively in Python or JavaScript when the app loads.