Відео

One of the best video! You've covered all base scenarios and explained some advantages too! I love you, mate!

There is no single magic bullet, oh maybe except "Tim Sort". 😅😅😅

What about SOUN?

They seem useful.

do you have a source code for this? badly needed

At 4:00 you explain recursion better than the ton of videos i've been watching. thanks

But using labels in java is considered as a bad practice, isn't it?

Makes sense. Why would businesses change years of business procedures for an "easy to use" chat bot that does not have as high a confidence interval as the layperson might think.

Intro music sounds like something straight out of Counter Strike. great video btw!!

thanks man

why do we need to append the big 9999999 number what if we didn't? dont really understand that

CODE IS WRONG!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

can someone tell what is the prioriy order in the expression num=item//10**(digit)%10

Hi, it's really helpful :D but is there a way to resize an image without losing quality please ? :(

you are a smart cookie. Thank you for this refresher

9 years later: Still the best.

there is a mistake at def remove(self,d) It should be self.root = this_node.get_next

Where can I get the slides?

Thank You!

Thanks for explaining this in a such simple and doable manner! 🎉🎉

Thanks a lot

Thank you. Best and most concise explanation I've seen thus far

Brilliant! Wonderful explanation.

Nice one ❤❤

does it work only for string type cause "" arrayList.toArray(new Integer[0]); " is giving error ?

Thanks man

Thank you for the video. It was pretty useful for me. I have a question: in a double For loop with <i> and <j> as counter, if <i> go from 0 to 20, and <j> goes from <i> to 20, the assignment <j=i> works, I mean if <j> changes its value, <i> remain with its own value. Why?

Excellent video! What I don't understand is how does the map and reduce function in python have anything to do with Hadoop's map and reduce? how are they related?

log(10 million) = 16.1, so how ya get 30?

Simply Explained in detail! Thank you!

is this an explanation?

How does one decide whether to use list comprehension or map/filter?

anyMatch() is not an intermediate operation because it returns a boolean

Thanks for such a clear, easy explanation!

Enjoyed it :)

Best Streams Tutorial out there

Love this!!!

Correction in a binary search tree (non-balanced) you say O(h) = O(log n) but worst case for non-balanced is a tree that is only going in one direction: 1,2,3,4,5,6. The worst case run time here is O(h) = O(n). Just for anyone who might end up confused. In a RB tree we leverage that we constantly rebalance and therefore achieve O(log n)

Random UA-camrs > College "Teachers"

couldn't understand this concept for the life of me, until I saw this video, thank you.

bless your frggn soul

Thank you so much for the video, it explains everything so clearly!

What is the program used in this video?

def fu(x): if x>0: result = x+fu(x-1) print(result) else: result = 0 return result fu(5) output: 1 3 6 10 15 could anybody please help me out with how this is working .. iv not been able to figure it out yet. thanks

thanks man, this is still valid for 2024

Thank you for sharing!

This was infinitely helpful. I love how you gave so many examples. Thus, allowing me to understand and play around with these examples. Best stream tutorial and will come back to it later as refreshers.

Your code goes outside of the window so we can see it fully

NICE!!

EXCELENTE: GOOD EXPLANATION. BETTER THAN MY TEACHER, AT COLLEGE.