You know it's a great explanation when you can code and submit the solution for yourself without even reading a single line of code from the instructor lol. Thank you!
Hey thanks for the code, I was banging my head towards the wall when I saw the solution at leetcode but there’s actually more than meets the eye with LIS n log n
I was also initially confused. But this is my understanding: Searching for an element in the pile is logn (binary search). We do this for every element in the array (n). So total complexity is nlogn
![[#2024MAMA] G-DRAGON - 무제(Untitled, 2014)+POWER+HOME SWEET HOME+뱅뱅뱅+FANTASTIC BABY | Mnet 241123 방송](http://i.ytimg.com/vi/Ox29z5Nf1Uk/mqdefault.jpg)
![BOWKYLION - วิงวอน (ex-change) [Official MV]](http://i.ytimg.com/vi/cLdnZWDaO-w/mqdefault.jpg)
You know it's a great explanation when you can code and submit the solution for yourself without even reading a single line of code from the instructor lol. Thank you!
You won’t remember the solution today. That day was a short term memory I think. 😬😬
Very clever explanation. Thank you so much!
This explanation is so clear and best so far on youtube..good job Kacy
Great explanation. Thanks a lot.
Simple makes PERFECT!
Great explanation, thanks!
this the best explanation of the n log n algorithm
Hey thanks for the code, I was banging my head towards the wall when I saw the solution at leetcode but there’s actually more than meets the eye with LIS n log n
2007 vibes
this guy is so cool
@@amadhurip9946 😎
I missed why this algorithm is nlogn
I was also initially confused. But this is my understanding:
Searching for an element in the pile is logn (binary search). We do this for every element in the array (n). So total complexity is nlogn
epic vid! thx!
yeah, I'd totally come up with that on the spot... :')) dp(n^2) solution though, I think so. But I will remember this in case I need it
give me your time machine
I was wondering why is 3 on the "3 6 7" pile but is ignored.
I forgot to draw a pointer to it
Bro u R me Fr
Code Ninja