Leetcode 2681. Power of Heroes

Compute the sum over all non-empty subsets of nums of (max(subset)^2 * min(subset)) modulo 1e9+7. With n up to 1e5 you must avoid enumerating subsets and instead use sorting plus combinatorial counting (powers of two) to accumulate each element’s contribution as max/min efficiently.