MediumNo. 1785
Minimum Elements to Add to Form a Given Sum — LeetCode 1785 Python Solution
- Pattern
- Greedy
- Topics
- Greedy, Array
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given an integer array nums and two integers limit and goal. The array nums has an interesting property that abs(nums[i]) <= limit.
Example
- Input
- nums = [1,-1,1], limit = 3, goal = -4
- Output
- 2
- Explanation
- You can add -2 and -3, then the sum of the array will be 1 - 1 + 1 - 2 - 3 = -4.
Python solution
class Solution:
def minElements(self, nums: List[int], limit: int, goal: int) -> int:
d = abs(sum(nums) - goal)
return (d + limit - 1) // limitComplexity
- Time
- O(n)
- Space · auxiliary
- O(1)
Pattern: Greedy
Take the locally best option every time — when you can prove that never costs you later. LeetCode 1785. Minimum Elements to Add to Form a Given Sum is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Greedy.
The greedy guide has the Python template for the pattern and the 346 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 1792 | Maximum Average Pass Ratio | Medium |
| 0011 | Container With Most Water | Medium |
| 0134 | Gas Station | Medium |
| 0135 | Candy | Hard |
| 0179 | Largest Number | Medium |
| 0324 | Wiggle Sort II | Medium |
Frequently asked questions
- How hard is LeetCode 1785. Minimum Elements to Add to Form a Given Sum?
LeetCode 1785. Minimum Elements to Add to Form a Given Sum is rated Medium on LeetCode.
- What is the time complexity of LeetCode 1785. Minimum Elements to Add to Form a Given Sum?
The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 1785. Minimum Elements to Add to Form a Given Sum?
The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 1785. Minimum Elements to Add to Form a Given Sum cover?
LeetCode 1785. Minimum Elements to Add to Form a Given Sum is tagged Greedy and Array on LeetCode.