2195. Time Needed to Buy Tickets
My accepted Python solution to LeetCode problem 2195, Time Needed to Buy Tickets, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.1MB
- Updated
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 0ms, memory 17.1MB, accepted 2025-12-30.
class Solution:
def timeRequiredToBuy(self, tickets: List[int], k: int) -> int:
time = 0
for i in range(len(tickets)):
if i <= k:
time += min(tickets[i], tickets[k])
else:
time += min(tickets[i], tickets[k] - 1)
return time