Відео

How is the T.C. O(N) ? Shouldn't it be O(NlogN) since each insertion operation in map takes logN time and there are N nodes?

Bad explanation... Khud hi padh rha hai khud hi samaj rha hai... Intuition to bata is solution ke pichhe.

wrong soln

Thank you brother

Damnnn

bro really said whatsapp💀

gorgeous and beautiful video thank you for your work

NIce work bro. I recently went over Dijkstra algo from my algorithms course but was having issues with the implementation. Thanks!

does is that can be decompile again to node js script?

Wow bro this is a unique and different way of teaching, it just teaches dijkstra along with how to code, its very diff from other videos on yt

You literally saved me...I was crying because I didnt understand this for the lab exam...but now I get it..Thanks<3

@ 15:35 row 5, col 6 should be 7 and not 6.

AMAZING!!

Best explanation ❤

Output?

Great bro👍

Thank you for video, i'm appreciate it. But before anyone try this, "spleeter" depend on Tensorflow with size about 578 Mb, so installing this lib will eat more than 1 Gb of my Disk Storage. Seriously for me it worst. Javascript can do better in runtime (browser only) with AudioContext / Audio class. Work with majority browser Chrome / Chromium / Firefox / (Safari with notes).

Why would you write C++ as if you write plain old C ?

Share the code

If I copy this setup and paste to other computer it will work or not.

The majority of people are using windows nowadays and there are very small numbers of people who are using Linux in comparison to windows users. I can't understand why are you showing a method which only useful for Linux users, why didn't you show the method for Windows users, especially since a lot of people do not like to work with the command line, and I am also one of them. By the way, your video is great but not useful for everyone.

Excelente tutorial, muy bien explicado

There was something wrong with my understanding and seeing you fill it step by step and explaining it slowly really helped. Thanks man. Test tomorrow morning, hoping I'll get a good grade when I retake it haha.

Hi Natesh, it's not relevant to this video, but how we can see the model for package pyttsx3?

doesnt work with node 13.14.0

Mmm, I am curious how to place to program code this "Sorry" in 10:39. 😀

9:33

Good explanation vro! You can optimise a bit by if(maxReach>=(n-1)) return jumps+=1; So we need not to go till i==n-1

Great stuff keep it up!

Why can't we re-initialise, steps = arr[i] instead of steps = maxReachable - i (according to your code)

Can i use it for a project which is using React, Node and MySQL ? And can it be deployable in shared hosting ?

gud

Good explanation... Thx!

Actual G

w[i] <= c. We have to include items that fills up the "knapsack" completely too

Thank you very much for this useful video

How can I have my cost matrix be placed in the code already, and not needing the user to input it?

thanks sir

thank you

Ye matrix chahiye

So good APS

Your work helped me a lot in my DS assignment, but in the assignment my professor adding one condition that there is no loop, which confused me a little bit. I wonder if you can help me to explain it. btw, great video man!

very good

Damn needs more views bro that was a good explanation

worst explanation

Vocal process in app.

How to adjust the vocal section in cover song or karaoke track song . Vocal effect processor. Thank you.

this is a piece of shit i want to turn a video with background music into music on splitter says Accepting audio files, 0.5 MB to 50MB, up to 20 minutes. video is 12 minutes long and is 11 mbs and it says audio is to long WHAT THE FUCK!!!!!!!!!!

This is the best and easiest implementation which I have come across thus far!!