Get Min Machines

Problem Overview

• Determine the minimum number of machines needed to run all tasks without overlap.
• Input: arrays start[i] and end[i] for n tasks; Output: integer minimum machines.
• Constraints: 1 ≤ n ≤ 2*10^5 and 1 ≤ start[i] ≤ end[i] ≤ 10^9.
• Real-world context: resource estimation and task scheduling in services.
• From IBM interviews; a coding interview problem and common interview question.