I like ur solution, need to keep in mind it

It's all good, we understand your feelings.

Ashamed
I didnt read output after solution, so now i understand how can behavior katas and it can be cause why have to no use mutable methods on input
thank you for patience, answer and kata

And isn't the answer to your question in the explanation after you passed the kata?

I think no one answer me for my stpd q, but after first part cata i understand what i need to do for solution, but what are in test array, that it made side effect on using methods, in google i just read that some of methods are immutable, some mutable, but i dont understand why it should uncorrect work with just delete last item on array pop()

join the question ++
but maybe in coursera has some free courses about ag and dm programming, just for me it will hard courses cause on Eng lang

I know this might be an offtopic question, but, does anyone know any source (book, pdf, webpage, yt videos, etc..) to learn angorithmics and BigO the proper way?
Like backtracking, dinamical programming, branch and bound, greedy and such?

Best regards!

Ok, ty for answer
That is meaning that i m not right way thinking

You have a problem there with the global var, when calling the function several times, it'll keep the previous value. Even then, recursion is not a good approach for this problem, because the input values are very large and it'll overflow the stack.

Go ahead, I'll try to answer it without giving out the solution.

@Chrono79 #Chrono79 Chrono79 Sorry for disturb, but can i ask some q for find solution?

That code will fail in your machine too when calling your function several times, read this

• on your machine, invoke your function twice one time after another in one run. It will also fail on your machine.
• even if you fix this problem, your solution probably will be too slow.