MediumNo. 1954
Minimum Garden Perimeter to Collect Enough Apples — LeetCode 1954 Python Solution
- Pattern
- Monotonic Stack
- Topics
- Math, Binary Search
- Reading time
- 2 min
- Source
- leetcode.com
The problem
In a garden represented as an infinite 2D grid, there is an apple tree planted at every integer coordinate. The apple tree planted at an integer coordinate (i, j) has |i| + |j| apples growing on it.
Example
- Input
- neededApples = 1
- Output
- 8
- Explanation
- A square plot of side length 1 does not contain any apples.
Python solution
class Solution:
def minimumPerimeter(self, neededApples: int) -> int:
x = 1
while 2 * x * (x + 1) * (2 * x + 1) < neededApples:
x += 1
return x * 8Complexity
- Time
- O(log n) or O(n log n)
- Space · auxiliary
- O(1)
Pattern: Monotonic Stack
Answer "what is the next greater element" for every position in one pass. LeetCode 1954. Minimum Garden Perimeter to Collect Enough Apples is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.
The monotonic stack guide has the Python template for the pattern and the 225 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0069 | Sqrt(x) | Easy |
| 0367 | Valid Perfect Square | Easy |
| 0400 | Nth Digit | Medium |
| 0441 | Arranging Coins | Easy |
| 0483 | Smallest Good Base | Hard |
| 0497 | Random Point in Non-overlapping Rectangles | Medium |
Frequently asked questions
- How hard is LeetCode 1954. Minimum Garden Perimeter to Collect Enough Apples?
LeetCode 1954. Minimum Garden Perimeter to Collect Enough Apples is rated Medium on LeetCode.
- What topics does LeetCode 1954. Minimum Garden Perimeter to Collect Enough Apples cover?
LeetCode 1954. Minimum Garden Perimeter to Collect Enough Apples is tagged Math and Binary Search on LeetCode.