POW(X, N) (Leetcode) - Code & Whiteboard

[@akintayosalu5882]

You the goat bro. Wish you made more vids. Super helpful.

[@babybear-hq9yd]

thanks bro! might get back to it one day, we'll see :)

[@darioarielgonzalezleegstra1741]

Thanks for the video :) Pretty clear. I guess that it could turn to O(1) space if its done iteratively

[@babybear-hq9yd]

pleasure:) you definitely could; though I think the tradeoff would be in time-complexity. Is it possible to run it in O(logN) time with O(1) space??