I tried to solve it with recursion, which I got some errors because it is reached recursion depth. So, you guys now that there is a constraint on using recursion approach. Test cases should actually be until it reaches the stack limit.

Looks like some test cases doesn't work anymore or doesn't check properly.
Even looking into solution and trying to paste the solution, returns an error. Unfortunately.

I think this is what it is supposed to be, not int(string)

I didn't understand this though. Can someone clarify it please? Or direct to the documentation.

Exeding execution time, on my local it works perfect.

it should be Xbonacci([1,0,0,0,0,0,1],10)==[1,0,0,0,0,0,1,2,3,6] YOu are right! I have kind of same problems.

Hey, Guys Look I have an issue with this..
I passed all tests except this one???? Help please?
it returns to me:
✘ [0.5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0.5] should equal [0.5, 0, 0, 0, 0, 0, 0, 0, 0, 0]
But how it is possible ??? Maybe if only the n is 0?

[1, 2, 3, 4, 5, 6, 7, 8, 9, 0] should equal ([1, 2, 3, 4, 5, 6, 7, 8, 9])
(This is the new problem, also could not passed when attempting!)

How Can I know what it passed to my function
My testing it passes very good.

Hi, Guys, I am passing the tests but when I try to attempt just one case not working for me. Probably I am getting "NameError".
Random tests...
xo(hExrLSxxbxNAxxQxxxkCooxoxxxJpoomtxxoxxGoUoxvofxodx) should be False

My code is working for all others? and if you see the data passed in to function is not a string so it make error? Cann some one explain for me?