Reveal Cards In Increasing Order

lcpy gen -n 950   # by problem number
lcpy gen -s reveal_cards_in_increasing_order   # by problem name

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.

Input: deck = [1,1000]
Output: [1,1000]

from collections import deque


class Solution:
    # Time: O(n log n)
    # Space: O(n)
    def deck_revealed_increasing(self, deck: list[int]) -> list[int]:
        queue: deque[int] = deque(range(len(deck)))
        result: list[int] = [0] * len(deck)
        for card in sorted(deck):
            # Reveal the card at the front position
            result[queue.popleft()] = card
            # Move the next position to the bottom
            if queue:
                queue.append(queue.popleft())
        return result