From 71d9f17be7bec1709bc353aad95f3feef3e0d59d Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Sat, 29 Nov 2025 15:55:24 -0500 Subject: [PATCH] Create README - LeetHub --- .../README.md | 50 +++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 0950-reveal-cards-in-increasing-order/README.md diff --git a/0950-reveal-cards-in-increasing-order/README.md b/0950-reveal-cards-in-increasing-order/README.md new file mode 100644 index 0000000..d0cf4a3 --- /dev/null +++ b/0950-reveal-cards-in-increasing-order/README.md @@ -0,0 +1,50 @@ +
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:
+ +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 <= 10001 <= deck[i] <= 106deck are unique.