Maximum Order Volume

Problem Overview

• Select non-overlapping customer calls to maximize total order volume.
• Input: arrays start[n], duration[n], volume[n]; Output: an int for the maximum achievable volume.
• Constraints: 1≤n≤1e5; 1≤start[i], duration[i]≤1e9; 1≤volume[i]≤1e3.
• Real-world context: scheduling a supermarket’s phone orders where missed calls are lost.
• From Snowflake interviews; a scheduling problem often used as a coding interview question.