Process Execution

Problem Overview

• Select a subset of processors to maximize total computing power; choosing power[i] excludes any with power[i] ± 1.
• Input: array power[n]; Output: long integer maximum sum.
• Constraints: 1 ≤ n ≤ 1e5, 1 ≤ power[i] ≤ 1e5; each processor used at most once.
• Real-world context: scheduling processors in a cloud services platform.
• From Citadel interviews, this coding interview problem is a common interview question.