This is the nicest explanation I have ever had! Please do more leetcode problems like this!

Thank you for the content man. Your channel is so underrated. This is my go to channel now. Keep it up man and your channel will blow up! Like everybody said use the playlist feature for similar content it makes a huge difference.

@WebDevSimplified

5 жыл бұрын

Thanks! I have these algorithm videos already in a playlist and have many playlists for my similiar content on my channel.

Love this series! I'd love to see more of the thought process and what clues to look for in the challange description to structure the code. I'm a beginner and sometimes struggle with my weird thought processes! Thank you for the great vid!

@WebDevSimplified

5 жыл бұрын

That is a great suggestion. I have another algorithm video coming out soon, so hopefully I explained it a bit more in depth for you.

These are amazing, and I'd love to see your breakdown of all the major sorting algorithms - along with a brief explanation of when it would be best to implement these types of sort

Man you should continue with this series ❤️ You are awesome!!

I absolutely love this series!

Thanks a lot bro! love your no nonsense teaching style. Please do more leetcode walkthroughs in the future.

@WebDevSimplified

5 жыл бұрын

I plan to keep covering them. They are fun to make.

This is great man, thank you so much for this.

Thank you! Great solution!

Thank you soo much for making this tutorial This helped me alot!! You are the best!!

thank you so much! love this series please make more of algorithms series!

@WebDevSimplified

5 жыл бұрын

I plan to make quite a few more.

Thank you for the video =) always look forward to these algorithm series.

@WebDevSimplified

5 жыл бұрын

You're welcome!

please make a series of this and never stop....thanks for everything. God bless you

@WebDevSimplified

5 жыл бұрын

I have a couple algorithm videos and plan to make more.

You have "simplified" this algo with ease....Thank you...Wish for these kind of videos on algo everyday

@WebDevSimplified

5 жыл бұрын

I wish I had enough time to do that.

@shuvajitmohanty9595

5 жыл бұрын

@@WebDevSimplified Hahaha

Have a series going through most of leetcode algo problems (easy/medium difficulties)! Great video!

@WebDevSimplified

5 жыл бұрын

That's the goal. I'm glad you enjoy them.

Thank you for this awesome video!

Great video! KZread needs more of these algorithm videos.

@WebDevSimplified

5 жыл бұрын

Thanks!

Awesome tutorials like always!

@WebDevSimplified

5 жыл бұрын

Thanks!

Thank you Web Dev Simplified. This is good!

@WebDevSimplified

5 жыл бұрын

You're welcome!

well said and good audio quality

Just subbed. Your channel is gold!

thank you this helped alot !!

Well done, great explanation!

@WebDevSimplified

4 жыл бұрын

Thank you

Thank you so much. This was very useful

@WebDevSimplified

5 жыл бұрын

I'm glad you enjoyed it!

That was nice problem to solve and great explanation from you, I’ll skip the code and write it by mslf🤍

Great topic and nice solution, Thanks

@WebDevSimplified

5 жыл бұрын

You're welcome!

Nice content and covered in a very nice way 🙏👍 thanx man🙏

@WebDevSimplified

4 жыл бұрын

You're welcome!

Well done!

I love your channel man! You are a pro, and your explanations are the best. Can you please make a video on notifications in PWA? Thanks

@WebDevSimplified

5 жыл бұрын

I plan to eventually jump into some PWA videos but I still have a lot of topics I want to cover first.

beautiful amazing fantastic mind-cracking idea :))

I subscribed your channel after watching the first video. I would love to listen more of these algorithms from you. if possible can you make the video on Binary Search and Binary Tree?

Dude, you are a true 'Algorithmist'🥰🥰

Thank You! just subscribed to your channel:)

Great video dude!

@WebDevSimplified

5 жыл бұрын

Thanks!

Thanks a lot .... Best explanation ever!!! :D

@WebDevSimplified

5 жыл бұрын

I'm glad you enjoyed it!

great one!!!

@WebDevSimplified

5 жыл бұрын

Thanks!

You are doing great!!! Please give as a full in-depth tutorial on MongoBD And use some live example to use it on project

@WebDevSimplified

5 жыл бұрын

That is on my list of todos. I have a Node.js MongoDB course that is free on KZread and covers Node.js and MongoDB in depth if you want to check that out.

Legendary

Just subscribed! The more you will share algorithms video the 10x more I am gonna share your algorithm video links with internet!

@WebDevSimplified

5 жыл бұрын

I'm really glad you enjoyed it.

@shreyasd4663

5 жыл бұрын

@@WebDevSimplified they only topic that doesn't put dust on internet is PROBLEM SOLVING. It's a win-win thing. You learn more you grow; you share it on KZread channel grows! Do share and make it happen! ;)

You're dope, brother.

I hope you could kindly show us how you create the video, all your technics help understanding while keeping all clean, very impressive, few can compete with you on this point. 👍

@WebDevSimplified

5 жыл бұрын

Thank you. What do you mean by showing you how to create the video?

thank you very much

@WebDevSimplified

5 жыл бұрын

You're welcome!

Does this program use Big O notation?

Quick question.Shouldn't j loop start from 1 though ? Thanks for your videos dude.

@herrklaus

3 жыл бұрын

Smart! Saves him the time of running it against the string he's already using as a reference.

Hi, Great explanation. Can you please make a video of how to solve Maximum sum sub array problem using Kadane's Algorithm in Javascript?

@WebDevSimplified

5 жыл бұрын

I can look into it

what is the pregress of two for loop in nested. Is the frist loop fn only execute one time then going into second loop fn, after second loop is finished* condition finished then return back to first loop for second time of first loop fn then go second loop fn again? hope helper can understand what i want to said =)

@WebDevSimplified

5 жыл бұрын

That is exactly what happens. Good analysis.

Also need php tutorials .great work

@WebDevSimplified

5 жыл бұрын

I probably won't be doing much PHP on this channel since I do not enjoy it as much and it is much less popular.

I am no JS expert, but I was wondering if the inner loop should start with j=1... since j = 0 would refer to the same string as the outer loop. Thanks.

@WebDevSimplified

5 жыл бұрын

That is correct. Good catch!

@diegocastro7434

3 жыл бұрын

I was thinking of this too but that would mess up the case if there was only one string. Great idea but you also would need to add if len(strs)==1 return strs[0]

it would be better if you had also covered the divide-and-conquer approach and binary-search approach to solve this problem.

Make a video on Longest Common "Substring" for "more than two strings"

You could also use a trie.

Thx you got subscription by me

There is a bug in the code actually. For example, strs = ["ab", "a"] will throw an index out of range error, We are comparing all indexes of strings with string 1, which in our case is "ab". Second string is of length 1. So, accessing the index 1 will produce an error.

@woto6090

Жыл бұрын

Yes, that's why you should sort the list with key=len first. Now you won't run in to index errors because you have the shortest member of the array.

@primordialmind

Жыл бұрын

@@woto6090 Why add O(nlogn) overhead, when you can make it work by slight if/else checks?

I can't do that, even you explain me, i guess that i have to really train in algorithmes

What if the first word is a million characters long though? Should we first sort the words by length, or would that be even worse space-time complexity?

Vertical method is very intuitive.

more algorithm videos pls

@WebDevSimplified

5 жыл бұрын

Will do!

You have such a great demeanor. Keeeeeeep it up, bro. Maybe just get a light for your face, lol.

And binary search method man?

can you do it with java,there is solutions but not realy explain what they did

@WebDevSimplified

5 жыл бұрын

You can definitely modify this to use Java. The concepts explained in this video apply to any programming language and the only difference is the syntax of JavaScript vs Java.

A python implementation people may find helpful. class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: longestPre = "" if strs: for i in range(len(strs[0])): char = strs[0][i] for j in range(len(strs)): try: if strs[j][i] != char: return longestPre except: return longestPre longestPre = longestPre + char return longestPre

Anyone know the run time complexity of this solution? It's O(n^2) isn't it? I feel like there HAS to be a better way of doing this..

@WebDevSimplified

4 жыл бұрын

If you go to the leetcode link in the description they have breakdowns of all the different solutions and time complexities. While this is not the fastest method it is significantly easier and not much slower.

@DanielLee-rr2qj

4 жыл бұрын

@@WebDevSimplified Ahh got it. Thank you!

["ab", "a"] = above code will fail for this case

There is a bug here. Suppose the String[] strs = [apple, ape, a] Starting with i = 0, 'a' is added to prefix. (BUG HERE) Then i = 1, here there will be an ARRAYOUTOFBOUND for i = 1 , j = 2 ...strs[j][i] for last string 'a'.

@WebDevSimplified

5 жыл бұрын

Javascript does not have array out of bounds errors. It just returns undefined if there is nothing at that index of the array.

@vinamra4893

5 жыл бұрын

Oh my bad! I used Java to program this and found it might give error. Thanks for reply and making this video! Otherwise I would have not understood concept of vertical scanning.

@WebDevSimplified

5 жыл бұрын

@@vinamra4893 No worries. I am really glad you enjoyed the video.

Your solution won't work for ["ab", "a"]

A *P P* L

hair is so distracting :P

This is working for me on Leetcode but when I copy it into VS code it returns 'undefined' when I pass in the array - const test = ["flower","flow","flight"] console.log(longestCommonPrefix(test)) Has anyone got any idea why this might be? Thanks and great video!!

@primordialmind

Жыл бұрын

There is a bug in the code actually. For example, strs = ["flower", "flow", "flight"] will throw an index out of range error, We are comparing all indexes of strings with string 1, which in our case is "flower". Second string is of length 4. So, accessing the index 4 will produce an error.