yeah, O(n)

i got value above thousands but still not sure what is it went wrong. need visualiser help to see that i forgot its actualy ^ and not *. whaat a wonderful time waste. hahaha

What's is the time complexity of this solution? Is it O(n)?

I like this solution much better then mine. It was the exact thing I thought I should do logic wise, but then I decided to do some whacky-hacky thing for fun.

This solution is so much better then my.
Thank you for it!

A bit late but if you check the question it's stated that the top cube(the last one) will have the volume of 1^3 so m will always have to be at least 1.

I misunderstood the question as well. I thought It told us to find the square root of the number instead lol.

Very strong solution.

Apparently I totally misunderstood the question. I need to be more careful, next time.

Thanks

What a brilliant code !

Comparing volume with 'm' twice per loop appears innefficient to me.

Great solution bro; my solution was lacking cuz i was thinking in maths, forgot all about that its programming,
i kinda get that think like a programmer a lil bit now.