วีดีโอ

It's our boy Jak

such a clear explanation. thank you.

It's a great video! If a viewer wants to look a little bit deeper, they could check section 7.2.2 of this PDF. ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2012/a9e76885a78c729f2375e14830caebf2_MIT6_046JS12_lec07.pdf

yep had this happen to me

Thank you

thanks! needed this

thank you so much for this sir

Nice! Studying computer science and this helped me a lot to visualize. Thank you!

Confused? Yes Very much

I'm ao confused

Best video of 2023

Great explanation, thank you.

great content

That title is amazing and you are doing a fine job, keep up the good work and I truly recommend a new mic when ever you can afford one at least a better headset mic

I need to take this to my teacher to show her how such details must be done !

All trans women are men/males. Also, I noticed you’re subbed to a known convicted human trafficker and woman abuser “justin eric king” from destin Florida aka beau of the fifth column. You should unsubscribe, but don’t mind when White women from Eastern Europe get physically abused and have their labor abused in justin eric kings human trafficker scheme.

bro is gaming

God damn, I watched my hour and a half lecture on this twice and you explained this better in 13 minutes.

I'll be picking this game up very soon.

Thank you, I was frustrated as well since I found no consistent video on other channels on how to make properly the lps table for the pattern.

Thanks so much for going through it slowly by hand, I've wasted a couple hours today trying to understand this but none of it clicked until now!

Here are the values of x1,x2,...xn in the inequalities restricted to 0 or 1? If not I do not see how a solution for the linear inequalities can necessarily be translated to a solution of 3SAT. Could you clarify on this point?

I've catched it. Good work!

N7.....Nice.Haircut on point as well.

great explanation, thank you

love when maths is shown to have real life applications! thankyou.

Would solving for 'x's this way ever lead to a variable being positive value? since there's a zero weight edge connecting all of them so it looks like the delta() can never get larger than '0' and hence the solution will always be of variables zero or less than zero. Am i correct?

I have come across this since I want to show inclusion in NP of a problem that can be reduced to this. Unfortunately, your argument for inclusion in NP is not sufficient, though. You say that, given values for x, one can obviously check in polynomial time whether A x <= b holds. This is clearly possible in time polynomial in |A|, |b| and |x|. But with this argument, any recursively enumerable problem would be in NP! For true inclusion in NP you need something stronger: this has to be possible in time polynomial in the size of the input to the original problem, i.e. polynomial in |A| and |b| only! Equivalently, you would have to show that one can always find a witnessing solution x of size polynomial in |A|+|b|. Is there any striking argument for that?

You're a legend. Thanks

Best video ever.

Its not clear, you have just described the procedure but not the logic behind it. To be specific you have not explained, why we are moving j to failure[j-1] when there is no match.

You are amazing, Thank You.

Excellent!!!!!!!!

This is the best video i ever seen for KMP i m subscribing your channel :). Thanks a lot man !

Great job!

Fantastically clear explanation. Thanks

Hey William, That's the simplest and greatest way I have seen to understand this KMP algorithm and believe me you have done it really nice. Thank you and I hope we will continue to have such nice videos from your channel

what is the thought process behind adding v0? How does adding v0 help us?

Why didn't you reduce the Hamiltonian Path to Linear Inequalities since it is easier?

Bernie for president? lmao

Great video thanks a lot.

Excellent video!

Thanks man! Spent a whole 3 hours trying to figure this out. You are a genius!

hey william, your explaination is crystal clear, do post some more videos ,it helps a lot, coding interviews

Great work buddy, Actually yours explanation is very easy to understood

< 3

I get how to do it. But I am just not satisfied cause I have not built an eye to see problems in the fashion yet. Pity me. One day though. Thanks, William.

There's unfortunately no Knapsack video following this lesson. 😔 Anyway, great explanation. Thanks

This video is really helpful, I also watched some of the TH-camr's video, all of them helps me a lot this semester. Thanks