วีดีโอ

Time complexity: O(N^3). As you can see in the constraints they made the input array be super small 1,000 max. That's because the time complexity of this algorithm is large. The for loop goes over all N and for each N there is O(N^2) which brings the overall to O(N^3). The space complexity is O(1) because its only an integer and the space to allocate does not grow if the input array is larger in size.

good stuff

Wish they were in python

Correction: When I talk about the while loop I say there would be an infinite loop if we didn't have the condition that a cycle is guaranteed. I shouldn't of said infinite loop. I should of said that if there wasn't a guarantee of a cycle we would write the loop ending condition differently.

Correction: ASCII character 'a' is decimal value 97. Here is the ASCII character map: th-cam.com/video/Xqde6e8XWG4/w-d-xo.htmlsi=lmbrgz5biraE0t_J&t=420

i really should try leetcode out :O