You should remove the whole Cheat check it block altogether.

Users trying to use such exploit will be punished anyways.

Actual test - Fixed tests

The assertions are all repeated twice, should keep 1 only

A=[[[]]]
expected=[[[]]]
test.assert_equals(sort_nested_list(A),expected)

...

A=[[[]]]        
expected=[[[]]]
test.assert_equals(sort_nested_list(A),expected)

Approved.

python new test frameworks

Random tests never generate cases where len(pipe) is less than n. It may lead to solutions like this.

which language ?

done. ;)

Since we are changing the description, we might as well fix the typos 🙃 :

• You have to construct 5X5 matrix with the letters of string and remaining alphabets written in this matrix (with only first occurence occurrence)

• Now you have to insert space characters in the ciphered string so that they are matching there their original position in the input string.

python new test frameworks are required.

Amazing kata.

The colors in the description could be changed to black for better visualization in light mode.

Approved.

Thanks. :-/

Description need fixing.

See the description change in this comment, author mistakenly placed the missing qr in the wrong step

It should be:

After step 1, 2, 3:  
  s = cozylumxmoxgivesxsmartsquidwhoasksforjobpenx

After step 4:  
  s = co zy lu mx mo xg iv es xs ma rt sq ui dw ho as ks fo ri ob pe nx  

After step 5:  
  ciphertext pairs = dn wf rl im es gq et mo mq ef iu ks tr gv ds fo nk as er kd ai qr

After step 6:    
  ciphered text = dnwf rlimes gqetm omqef iukst rgv dsfo nka ser kda iqr 

Step 4: Break the given plaintext into pairs.

After Steps 1, 2, and 3:
s = cozylumxmoxgivesxsmartsquidwhoasksforjobpenx

After Step 4:
s = co zy lu mx mo xg iv es xs ma rt sq ui dw ho as ks fo ri ob pe nx qr

Where did the last qr come from?