EDIT: nevermind

Perhaps operations with sets may fasten your code.

I've solved it, haven't solved the additional problems on submit however. Well, not in the speed it requires :( I'll have to get back to this

I'm interested in having a word from you when you solve it.

It's says to form sub-arrays of contiguous terms. 324 has 289 before and 361 after. 1 and 324 are not contiguous. Thanks for the feedback, and I'll be waiting your answer if you've got any doubt.

Hey! I am working on this kata as we speak and I think I may have ran into an error. The permutational list for the first example is [3, 5, 2] (dig_list)----> [2, 3, 5, 23, 25, 32, 35, 52, 53, 235, 253, 325, 352, 523, 532]

You asked for a combination of perfect powers of two that would be in this list but you only mentioned 5 and 25. I found that 324 + 1 is another combination. seeing as in

powL = [1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529]

there is indeed a sub array of 324 and 1

Thanks!

I had the same issue, I created my own equals method within the Vector object, makes it easier