Available question text
Compute the sum of minimum and maximum elements across all subsequences of nums of size ≤ k. Sort nums and use combinatorics to count how many subsequences make each element the min or max (with precomputed nCr/mod 1e9+7) to accumulate contributions efficiently for n up to 1e5 and k ≤ 70.
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 3428. Maximum and Minimum Sums of at Most Size K Subsequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source