## Algorithm

Problem Name: 950. Reveal Cards In Increasing Order

You are given an integer array `deck`. There is a deck of cards where every card has a unique integer. The integer on the `ith` 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:

1. Take the top card of the deck, reveal it, and take it out of the deck.
2. If there are still cards in the deck then put the next top card of the deck at the bottom of the deck.
3. 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.

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 the bottom.  The deck is now [7,13,11,17].
We reveal 7, and move 13 to the bottom.  The deck is now [11,17,13].
We reveal 11, and move 17 to the bottom.  The deck is now [13,17].
We reveal 13, and move 17 to the bottom.  The deck is now [17].
We reveal 17.
Since all the cards revealed are in increasing order, the answer is correct.
```

Example 2:

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

Constraints:

• `1 <= deck.length <= 1000`
• `1 <= deck[i] <= 106`
• All the values of `deck` are unique.

## Code Examples

### #1 Code Example with Javascript Programming

```Code - Javascript Programming```

``````
const deckRevealedIncreasing = function(deck) {
const n= deck.length;

deck.sort((a, b) => a - b)
const q = [];
for (let i=0; i < n; i++) q.push(i);
const res = new Array(n).fill(0);
for (let i=0; i < n; i++){
res[q.shift()]=deck[i];
q.push(q.shift());
}
return res;
};
``````
Copy The Code &

Input

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

Output

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

### #2 Code Example with Python Programming

```Code - Python Programming```

``````
class Solution:
def deckRevealedIncreasing(self, deck):
ind = list(range(len(deck)))
for num in sorted(deck):
deck[ind[0]] = num
ind = ind[2:] + [ind[1]] if len(ind) > 1 else []
return deck
``````
Copy The Code &

Input

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

Output

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

### #3 Code Example with C# Programming

```Code - C# Programming```

``````
using System;
using System.Collections.Generic;

namespace LeetCode
{
public class _0950_RevealCardsInIncreasingOrder
{
public int[] DeckRevealedIncreasing(int[] deck)
{
var index = new Queue < int>();
for (int i = 0; i  <  deck.Length; i++)
index.Enqueue(i);

Array.Sort(deck);

var results = new int[deck.Length];
foreach (var card in deck)
{
results[index.Dequeue()] = card;
if (index.Count > 0)
index.Enqueue(index.Dequeue());
}

return results;
}
}
}
``````
Copy The Code &

Input

cmd
deck = [1,1000]

Output

cmd
[1,1000]