Reveal Cards In Increasing Order Problem

Reveal Cards In Increasing Order Problem — ExecCode Medium DSA Practice

Solve the Reveal Cards In Increasing Order problem on ExecCode. Free online medium DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer array deck. There is a deck of cards where every card has a unique integer. The integer on the i^th card is deck[i]. You can order the deck in any order you want. Initially, all the cards start face down (unrevealed) in one deck. You will do the following steps repeatedly until all cards are revealed: Take the top card of the deck, reveal it, and take it out of the deck. If there are still cards in the deck then put the next top card of the deck at the bottom of the deck. If there are still unrevealed cards, go back to step 1. Otherwise, stop. Return an ordering of the deck that would reveal the cards in increasing order. Note that the first entry in the answer is considered to be the top of the deck. Examples Example 1 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. After reordering, the deck starts as [2,13,3,11,5,17,7], where 2 is the top of the deck. We reveal 2, and move 13 to the bottom. The deck is now [3,11,5,17,7,13]. We reveal 3, and move 11 to the bottom. The deck is now [5,17,7,13,11]. We reveal 5, and move 17 to th…

Examples

Input deck = [17, 13, 11, 2, 3, 5, 7]; Output [2, 13, 3, 11, 5, 17, 7]. Input deck = [1, 1000]; Output [1, 1000]

Constraints

1 <= deck.length <= 1000 1 <= deck[i] <= 10^6 All the values of deck are unique.

Practice Reveal Cards In Increasing Order free on ExecCode. Browse DSA problems, topic map, and placement guides.