EasyNo. 2582
Pass the Pillow — LeetCode 2582 Python Solution
- Pattern
- Math and Number Theory
- Topics
- Math, Simulation
- Reading time
- 2 min
- Source
- leetcode.com
The problem
There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially.
Example
- Input
- n = 4, time = 5
- Output
- 2
- Explanation
- People pass the pillow in the following way: 1 -> 2 -> 3 -> 4 -> 3 -> 2.
Python solution
class Solution:
def passThePillow(self, n: int, time: int) -> int:
ans = k = 1
for _ in range(time):
ans += k
if ans == 1 or ans == n:
k *= -1
return ansComplexity
- Time
- O(time)
- Space · auxiliary
- O(1)where time is the given time
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 2582. Pass the Pillow is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0043 | Multiply Strings | Medium |
| 0258 | Add Digits | Easy |
| 0412 | Fizz Buzz | Easy |
| 0415 | Add Strings | Easy |
| 0537 | Complex Number Multiplication | Medium |
| 0592 | Fraction Addition and Subtraction | Medium |
Frequently asked questions
- How hard is LeetCode 2582. Pass the Pillow?
LeetCode 2582. Pass the Pillow is rated Easy on LeetCode.
- What is the time complexity of LeetCode 2582. Pass the Pillow?
The Python solution on this page runs in O(time).
- What is the space complexity of LeetCode 2582. Pass the Pillow?
The Python solution on this page uses O(1), where time is the given time auxiliary space.
- What topics does LeetCode 2582. Pass the Pillow cover?
LeetCode 2582. Pass the Pillow is tagged Math and Simulation on LeetCode.