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