Reveal Cards In Increasing Order — LeetCode 950 Python Solution

The problem

You are given an integer array deck. There is a deck of cards where every card has a unique integer.

Example

Input

deck = [17,13,11,2,3,5,7]

Output

[2,13,3,11,5,17,7]

Explanation

We get the deck in the order [17,13,11,2,3,5,7] (this order does not matter), and reorder it.

Python solution

class Solution:
    def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
        q = deque()
        for v in sorted(deck, reverse=True):
            if q:
                q.appendleft(q.pop())
            q.appendleft(v)
        return list(q)

Complexity

Pattern: Stack

When the most recent unresolved thing is the one that matters, use a stack. LeetCode 950. Reveal Cards In Increasing Order is filed here because LeetCode tags it Queue, which is the vocabulary this hub collects.

The stack guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Related problems