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
Very clever explanation. Thank you so much!
Great explanation. Thanks a lot.
This explanation is so clear and best so far on youtube..good job Kacy
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. 😬😬
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
Great explanation, thanks!
this the best explanation of the n log n algorithm
epic vid! thx!
2007 vibes
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
Bro u R me Fr
I was wondering why is 3 on the "3 6 7" pile but is ignored.
I forgot to draw a pointer to it
Code Ninja