วีดีโอ

aga aksan yapmaya kasmasan iyi video

SHould've put the answer at then end of the video. Paused the video and played when done thinking the answer would be revealed to validate. Nice video though. Thanks

I never understood this kind of usefull concept within this short time of period.

Remember guys for understanding recursion you first need to understand recursion

boweeeeeeeeeeeeeeeeeeeeeeeeeeeeeee

def max_vowel(string, k): vowel = 'aeiou' total = len([i for i in string[0:k] if i in vowel]) mx = total for i in range(len(string)-k): if string[i] in vowel: total -= 1 if string[i+k] in vowel: total += 1 mx = max(total, mx) return mx

amazing

No

how to prove

Such a good video! But we have to think that recursion is not always the best solution

Great explanation

This is by far the best explanation I've seen on this topic! Thank you so much!

Cool. However in Computer Science, a Tree DS is a Directed Acyclic Graph(DAG)

Hello everyone this is the correct solution def knapsack(values,weights,k,i=0): if i == len(values): return 0 elif k < 0: return float("-inf") elif weights[i] > k: return knapsack(values, weights, k, i + 1,) else: return max(values[i]+knapsack(values,weights,k-weights[i],i+1),knapsack(values,weights,k,i+1))

My exam will be in 4 mins thanks soooo muchhh ill subscribe to you

perfect!

make sense, thanks

This is absolutely brilliant ❤. Please keep posting such gems 🙏🏼. Love from India 🇮🇳

Insanely good explanation and animation, thank you.

i fw this heavy, good shit fn

wow. that proof for heapify runtime is so beautiful. take my sub for that

Why is the last line in the program Theta(n) and not just a constant time operation?

What is the notepad you're using here?

You fail to indicate that the two straight paths from a to neg_a and from neg_a to a do not exist in the original graph you constructed from the CNF example. It is given as a third example. Peace and acceptance to Israel.

Is "free Palestine" as a stand-alone in order here? Are you sure you really know what's going on and how we arrived at this situation?

I love all your videos! I wish everything was explained like these!

inshallah is something else ❤

These diagrams are so helpful! Thanks for the great video and explanation!

Yes

Excellent explanation

No it is not

Very straightforward video with clear graphics. Appreciate your work!

java pls

Cool cool and so cool 🎉

All the good animation and it leads to wrong code..

can the fisher-yates shuffle start from the first index as long as we keep track of the unshuffled and shuffled part correctly?

your explanation is just simply brilliant ... I love it

Excellent !!

most intuitive explaination out there

❤❤❤❤❤❤ wowww

Best analysis!

Thank you, it was the best

No

Great video.

THANKS !!!

beautifully put.

It have 16 subsets

They could be in the same grid and they are not neighbors at d = r✓2

Awesome explanations, keep up the good job, dude !