Shuffle Deck Complexity | Dataford Interview Questions

Write a function to shuffle a deck of cards thoroughly and explain the time and space complexity of your approach.

Use the signature def shuffle_deck(deck, seed):. deck is a list of card identifiers, and seed makes the result reproducible for testing. Return a new list containing the same cards in uniformly randomized order, leaving the input list unchanged. Implement the shuffle rather than calling a library shuffle function.

Input and Output

The input is a list of values and an integer seed. The output is a permutation of the input list. For a fixed seed, the output must be deterministic.

Constraints

0 <= len(deck) <= 52
Deck elements may be any Python values
The output must contain exactly the same elements as the input
The input list must remain unchanged
The seed is an integer

Function Signature

def shuffle_deck(deck, seed):

Your question is Shuffle Deck Complexity. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem