LC-2073 Easy LeetCode

2073. Time Needed to Buy Tickets

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 71% Topics: Array, Queue, Simulation

Reading material

Arrays & Hashing 12 min Stacks & Queues 11 min Simulation & Enumeration 9 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def timeRequiredToBuy(self, tickets, k):
        """
        :type tickets: List[int]
        :type k: int
        :rtype: int
        """
        return sum(min(x, tickets[k] if i <= k else tickets[k]-1) for i, x in enumerate(tickets))

Solution from kamyu104/LeetCode-Solutions · MIT