Minimize Effort with EffiBin Kit

Problem Overview

• Minimize the total effort of an array after allowed updates.
• Operation: choose i, j where effort[i] is divisible by effort[j], then set effort[i] = effort[j].
• Return the minimum possible sum; constraints: 1 <= n <= 2e5, 1 <= effort[i] <= 2e5.
• Real-world context: Amazon’s EffiBin Kit for organizing storage bins.
• From Amazon interviews; a coding interview problem and interview question.