You don't need to in this case. This isn't faster or more efficient than other solutions and is less readable

🤦‍♂️🤦‍♀️🤦‍♀️

COBOL translation + description sligthly reworded (size of arrays is already dependent on the language), please review carefully.

👍👍

This is scary😂

This problem definately thought me about the problem of writing inefficient code.

I had the same problem, the tests contain lists one million in length, i tried running my solution on my locally on my system for a list I generated randomly, it took forever to run. I think we just need a more optimised solution, my solution has a time complexity of O(n**2) meaning for a list of length 1000000 my task perfoms 1000000 squared (one trillion) operations. At this moment i haven't thought of a more optimized solution and i might just resolve to looking up solutions eventually.

best readable code in the history of codewars

Thanks!

I think the fact that you were patients enough to work all possible test case is admirable

If n is less than 3 you should return the first n sequence don't forget. For instance if the sequence is [a, b, c] and n is 2, you should return [a, b] or if n is 1, you should return [a]