The Tower of Epiphany Think Like A Coder, Ep 7
video description
Date: 2020-08-22
Related videos
Comments and reviews: 5
AwesumSawseMan
i swear the nodes are rip-offs of infinity stones, but i cant blame you. I wouldn't have thought of anything better either. Also thank you ted for inspiring me to become a computer scientist.
reply
i swear the nodes are rip-offs of infinity stones, but i cant blame you. I wouldn't have thought of anything better either. Also thank you ted for inspiring me to become a computer scientist.
reply
help
i would've scanned the whole thing into memory and then taken a row-by-row approach, counting the number of non-walled spaces between the walls furthest to the left and right
reply
i would've scanned the whole thing into memory and then taken a row-by-row approach, counting the number of non-walled spaces between the walls furthest to the left and right
reply
Omar
Just a note for correcting some information in 6: 02
N2 is not exponential, it's quadratic. An exponential function is (commonly in algorithms) 2N
reply
Just a note for correcting some information in 6: 02
N2 is not exponential, it's quadratic. An exponential function is (commonly in algorithms) 2N
reply
Sounak
I'm late to the series, but I'm calling it now. The last episode will be about a maze solving algorithm and they'll probably use DFS to do so.
reply
I'm late to the series, but I'm calling it now. The last episode will be about a maze solving algorithm and they'll probably use DFS to do so.
reply
Kendallonian
This is the first episode that left me unsure of whether I could write an algorithm to accommodate the problem. It's genuinely tricky.
reply
This is the first episode that left me unsure of whether I could write an algorithm to accommodate the problem. It's genuinely tricky.
reply
Add a review, comment
Other channel videos
