Get Max Traffic Time

Problem Overview

• Find the earliest second when the number of clients concurrently interacting with a server is maximized, with end times inclusive.
• Input: arrays start[n] and end[n]; Output: an integer time of peak concurrency.
• Constraints: 1 ≤ n ≤ 1e5 and 1 ≤ start[i] ≤ end[i] ≤ 1e9.
• Real-world context: determine peak server traffic in a client/server system.
• This coding interview problem from IBM interviews is a common interview question.