Hotspot Connections

Problem Overview

• Compute the maximum new edges addable to an undirected employee graph while no employee is connected to more than max_connections special employees.
• Input: employee count, edges, special employees, max_connections. Output: addable edges (long). No self-loops/duplicate edges; initially no special–special edges; up to 2e5 nodes.
• Real-world context: company hotspot sharing where connectivity to special employees drives access.
• From Flexport interviews; a coding interview problem and interview question.