@greghogg5: Noob Recursive Backtracker vs Dynamic Programming Tabulator #softwareengineering #softwaredevelopment #java #software #softwarejobs #softwareengineer #datastructures #leetcode #programming #javadeveloper #datastructuresandalgorithms #python #softwaredeveloper #code #FAANG #coding #javascript #javascriptdeveloper #codingisfun #codinginterview #js #html #css #sql
Greg Hogg
Region: CA
Tuesday 07 May 2024 14:33:12 GMT
Music
Download
Comments
Jed :
In what situation is a recursive solution optimal, it always just seems slow
2024-05-07 14:50:05
66
Stinkymonkey222 :
DYANMIC PROGRAMMING RAHHHHH
2024-05-07 22:14:29
1
MR.PURPLE :
Can you review time complexity vs space complexity? I’m not familiar with space complexity
2024-05-08 01:26:26
1
neilkulkarni1 :
Turns out the linear solution is not optimal. Fibonacci numbers can be computed in constant time!
2024-05-07 15:02:56
27
Nameless :
there's a mathematical solution for Fibonacci, and you didn't need n space.
2024-05-07 20:28:18
2
user5603548845050 :
The recursive solution uses space for the call stack. However, he could have done the bottom-up approach in O(1) space by using vars instead of a list
2024-05-08 02:53:59
7
velzix :
now there's extra space complexity 🤣
2024-05-07 21:25:34
2
bogdybogdy8772 :
do you know that there is a O(log n) algorithm to find the n-th Fibonacci Numbers ?
2024-05-07 15:46:23
6
PhysicsDragon :
what about:
F_n=(φ^n+1/φ^n)/sqrt(5)
where φ is the golden ratio?
2024-06-02 21:04:29
1
yhermoni21 :
God tier programmer using python??
2024-05-09 04:50:23
0
spacelabrat :
but do you need all that memory?
2024-06-12 16:44:06
0
MythicalNonexistentDrPepper :
can you do a question that might be useful for financial planning?
2024-05-07 22:26:39
1
Eric Orr :
For c++ id go the const expression route and essentially just calculate them at compile time.
2024-05-08 07:54:11
3
Dima:) :
why do you need to store all the numbers along the way if you only need two previous ones? the array is not needed - constant memory
2024-05-10 16:18:48
0
Jans Dufersmilt :
in range(2, n+1): what does the two mean?
2024-05-09 00:36:05
0
Jc :
What is he using to get and test these problems?
2024-05-09 10:57:55
0
PaduraruH☦️ :
What is the website?
2024-05-09 16:30:34
0
Edxon Rodríguez :
Commenting just to stay on this side of leetok
2024-05-09 11:45:23
0
buildertruck :
real geniuses get it in O(1) using binet’s formula
2024-05-08 12:55:41
0
jellegrasdijk :
What if n = 0?
2024-06-04 16:11:24
0
Greg Hogg :
I hope you enjoyed the reel, thanks for watching! Kindly email [email protected] if you're interested in DSA tutoring. Have a great day! :)
2024-05-07 14:35:51
1
Vali :
you don’t need an array to store all the numbers, bad solution, fired
2024-05-07 14:52:04
9
ናሆም🕸️ :
hey can you teach me please I am grade 11th student 🙏🙏🙏🙏🙏🙏
2024-05-07 14:45:40
0
Barkenflops Mcgee :
Linear space? Get outta here
2024-06-21 13:09:18
0
Michael Holmes :
what website is this?
2024-05-08 19:41:26
1
To see more videos from user @greghogg5, please go to the Tikwm
homepage.