you need to create a program that looks at this list and understands which letter is followed by , i.e. look at the example 'w' in front of all letters, i.e. its index is 0 then see 2 letter in turn goes 'h',
yes just look at the example there are several sheets carefully look at what letter after which it is after that type in turn and now your word is ready, I did in 30 minutes , its a good kata

You should read this : https://docs.codewars.com/training/troubleshooting/

Your Code is not visible as it would be tagged as spoiler. You can simply print the array and it will be visible in the log of the test cases. After that just manipulate the test cases to pass the test.

I can see you have nested for loops making your solution O(n^2) which wont work for some of the test cases. You need to find a way to solve it with a O(n).

Your code is not optmised to work with longer arrays, whilst your code likely works, it takes too long to solve the harder problems so times out. This questions is as much an optimisation problem as any. So you need to find a way to optimise your solution