!

Use "Date" class.

Give reasons. It's useless to give a comment like this and not provide how to improve.

You don't need to memorize them. That's what MDN is for mate. Even professional developers use references because there is simply to much to remember.

COMPLETE GARBAGE

I agree with you. The sample tests explained the problem better than the description.

Thanks for this reply.

As soon as I read it I figured out what I was doing wrong.

Sorry for the late response. There are some scenarios in which your solution doesn't work as expected. For example given the arguments ant([[1, 0, 1], [0, 1, 0], [1, 0, 1]], 0, 0, 1, 1), the correct solution would be [[0, 0, 1], [0, 1, 0], [1, 0, 1]] (n is one so there is only one iteration and only the element at index 0,0 should change, but your function returns [[0, 0, 0], [0, 0, 1], [0, 1, 0], [1, 0, 1]]. Hope this helps...

I agree.

nope. But you're searching for the "big foot", with the kind of keywords. ;)
Since evaluation of a string may be done with recurcive parsing, I guess that's all you need to reach the recursion limit: 1001 numbers to pultiply means 1000 * operators, which in turn may mean (depending on the implementation) 1000 recursive calls (or evnen worse...)

no, if you get a reccursion limit error, it's triggered be a recursion. It's coming from the guts of the implementation of eval, that's all. So it's still triggered by your code, even if it's not it that is recursive.

read the message again, it tells explicitly that this error comes from that line of your code. So, guess what? surely it comes from the function you currently use in that line. ;)

btw: don't use that... ;)

Thanks for the compliment, and keep thinking! :-)

Updated description.

Sorry I misread it, I think they should be integers, but without actually solving it I can't be sure.