Leetcode Problem 891. Sum of Subsequence Widths

891. Sum of Subsequence Widths

Leetcode Solutions

Sort the array nums.
Initialize mod to 10^9 + 7 for taking modulo.
Initialize sumWidths to 0, which will store the final result.
Iterate through the array with index i.
- Calculate the power of 2 for the current index i and for n - i - 1 (where n is the length of nums), taking modulo mod.
- Add to sumWidths the contribution of nums[i] as a maximum, which is nums[i] * (2^i - 1).
- Subtract from sumWidths the contribution of nums[i] as a minimum, which is nums[i] * (2^(n - i - 1) - 1).
- Take modulo mod after each addition and subtraction.
Return sumWidths as the final answer.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen