Welcome
This kata is inspired by This Kata
We have a string s
We have a number n
Here is a function that takes your string, concatenates the even-indexed chars to the front, odd-indexed chars to the back.
Examples
    s = "Wow Example!"
    result = "WwEapeo xml!"
    s = "I'm JomoPipi"
    result = "ImJm ii' ooPp"
The Task:
return the result of the string after applying the function to it n times.
example where s = "qwertyuio" and n = 2:
    after 1 iteration  s = "qetuowryi"
    after 2 iterations s = "qtorieuwy"
    return "qtorieuwy"
 Note 
there's a lot of tests, big strings,
and n is greater than a billion
so be ready to optimize.
after doing this: do it's best friend!
# Check out my other kata!
Matrix Diagonal Sort OMG
String -> N iterations -> String
String -> X iterations -> String
ANTISTRING
Array - squareUp b!
Matrix - squareUp b!
Infinitely Nested Radical Expressions
pipi Numbers!
def jumbled_string(s, n):
    mixer = lambda s: s[::2] + s[1::2]
    
    if n == 1: return mixer(s) 
    
    # Count max possible iterations
    cnt = 1
    x = s
    while s != mixer(x):
        cnt += 1
        x = mixer(x)
            
    # Calculate needed amount of iterations         
    max = n % cnt
    while max != 0:
        s = mixer(s)
        max -= 1
    return s
def jumbled_string(s, n):
    mixer = lambda s: s[::2] + s[1::2]
    
    if n == 1: return mixer(s) 
    
    # Count max possible iterations
    cnt = 1
    x = s
    while s != mixer(x):
        cnt += 1
        x = mixer(x)
            
    # Calculate needed amount of iterations         
    max = n % cnt
    while max != 0:
        s = mixer(s)
        max -= 1
    return s