OJ Board

Hello, I have tried to solve the Crypt Kicker using recursion, but I get TLE on inputs with number of dictionary words close to 1000 and lines that cannot be decoded, since it takes a lot of time to go through all the words. I've put the dictionary words in an array of ArrayLists based on word ...

Hmm I still don't understand:
For sequence 6 1 4 3 7 5 10, the differences are:
5 3 1 4 2 5 -> but 6 is missing here, so shouldn't it be "Not jolly", since n = 7?
Thanks.