Това с речниците вероятно е вариант, понеже задачата е от преди речниците, ако не се лъжа. Но е оригинално, благодаря !

Търся и решението на Faro Shuffle от Lists Basics Exercise.  Достигам до 20/100 и не мърдам нагоре.

     Faro Shuffle
A faro shuffle of a deck of playing cards is a shuffle in which the deck is split exactly in half and then the cards in the two halves are perfectly interwoven, such that the original bottom card is still on the bottom and the original top card is still on top.
For example, faro shuffling the list
['ace', 'two', 'three', 'four', 'five', 'six'] once, gives ['ace', 'four', 'two', 'five', 'three', 'six' ]
Write a program that receives a single string (cards separated by a space) and on the second line receives a number of faro shuffles that have to be made. Print the state of the deck after the shuffle
Note: The length of the deck of cards will always be an even number
Example:
Input:
a b c d e f g h
5

Output:
['a', 'c', 'e', 'g', 'b', 'd', 'f', 'h']

Input:
one two three four
3

Output:
['one', 'three', 'two', 'four']
    

Здравей, това е работещо решение: 

https://pastebin.com/kGxati8f

Сигурно има и по-оптимално решение :) 

Едно изчистено решение от мен.

deck = input().split()
shuffle_count = int(input())
half = len(deck) // 2
for _ in range(shuffle_count):
    new_deck = []
    first_half = deck[:half]
    second_half = deck[half:]
    for i in range(len(first_half)):
        new_deck.append(first_half[i])
        new_deck.append(second_half[i])
    deck = new_deck
print(deck)

Mersi mnogo !