Available question text
Compute the sum of (max - min) over all non-empty subsequences modulo 1e9+7; the core idea is to sort the array and use combinatorics: each element's contribution as possible maximum vs minimum can be counted by powers of two, avoiding enumerating subsequences.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 891. Sum of Subsequence Widths
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source