Available question text
Find the smallest-length subsequence whose sum is strictly greater than the sum of the remaining elements; if multiple, pick the one with the larger total sum, and return it sorted in non-increasing order. This is typically solved by sorting and greedily taking the largest elements until their sum exceeds the rest.
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 1403. Minimum Subsequence in Non-Increasing Order
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source