Available question text
Compute the sum (mod 1e9+7) of the "power" of every k-element subsequence of nums, where a subsequence's power is the minimum absolute difference between any two of its elements. With n ≤ 50 this requires sorting and combinatorial counting/DP to aggregate each possible gap's contribution efficiently rather than enumerating all subsets.
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 3098. Find the Sum of Subsequence Powers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source