we have encoded strings that want to decryption it. First, the first letter of the string, then the last letter. Then the rest of the letters are stored in the same way. For example, the string amir is first added to the new letter. Then the last letter is r. This process continues in the same way, ie in the next stage m and in the next stage after the addition. (That is, first the first letter and the last letter, then the second letter and then the last letter of the last letter, and this process continues until the word) In the second step, the whole string is reversed. In the third step, the letter a becomes 4. The letter o is replaced by 0. The letter t becomes 7 and finally the letter i becomes 1.
Note: It is guaranteed that the number of letters is always even and only includes lowercase English letters
example:
input 1mr4
output amir
input w00lrlledh
output helloworld
I read this but I have no idea of write a program