Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

1519. Minimum Subsequence in Non-Increasing Order

My accepted Python solution to LeetCode problem 1519, Minimum Subsequence in Non-Increasing Order, running in 3ms.

  • Difficulty: Easy
  • Python
  • Runtime 3ms
  • Memory 17.2MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 3ms, memory 17.2MB, accepted 2025-12-30.

python
class Solution:
    def minSubsequence(self, nums: List[int]) -> List[int]:
        total = sum(nums)
        nums.sort(reverse=True)
        result = []
        curr_sum = 0
        
        for n in nums:
            result.append(n)
            curr_sum += n
            if curr_sum > total - curr_sum:
                break
        
        return result

Source