How To Solve Algorithms - Longest Common Prefix

[@jordantalbot8584]

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]

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

[@jeremyzhang8603]

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

[@Sonoioilmago]

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]

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.

[@shuvajitmohanty9595]

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

[@WebDevSimplified]

I wish I had enough time to do that.

[@shuvajitmohanty9595]

@@WebDevSimplified Hahaha

[@pushpakgupta7396]

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

[@WebDevSimplified]

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

[@ROotHM]

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

[@BrendanMetcalfe]

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

[@PortEXE]

Great video! KZbin needs more of these algorithm videos.

[@WebDevSimplified]

Thanks!

[@KallyanBRoy]

Dude, you are a true 'Algorithmist'🥰🥰

[@JoeWong81]

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

[@WebDevSimplified]

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

[@primordialmind]

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?

[@f3-faithfitnessfinance]

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

[@mandihaase2744]

I absolutely love this series!

[@ActiveZeni]

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

[@WebDevSimplified]

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

[@Lads-]

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

[@WebDevSimplified]

I plan to make quite a few more.

[@shreyasd4663]

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

[@WebDevSimplified]

I'm really glad you enjoyed it.

[@shreyasd4663]

@@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 KZbin channel grows! Do share and make it happen! ;)

[@crestmarinaris6113]

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

[@WebDevSimplified]

You're welcome!

[@obasajujoshua9860]

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

[@pawanvora]

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]

That is correct. Good catch!

[@diegocastro7434]

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]

[@manishbhatt1101]

Thank you Web Dev Simplified. This is good!

[@WebDevSimplified]

You're welcome!

[@4541047]

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]

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

[@vishalscit]

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

[@herrklaus]

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

[@yesweet]

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]

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

[@vladimirjean]

Awesome tutorials like always!

[@WebDevSimplified]

Thanks!

[@qwertykeypad789]

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]

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

[@akamfoad]

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

[@samartajshaikh2601]

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

[@MrWolfgangWeiss]

Well done, great explanation!

[@WebDevSimplified]

Thank you

[@tsukasa8179]

Legendary

[@chrisdanikas7918]

Great video dude!

[@WebDevSimplified]

Thanks!

[@miw879]

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

[@oop_web7707]

Thank you so much. This was very useful

[@WebDevSimplified]

I'm glad you enjoyed it!

[@krishy9661]

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]

I can look into it

[@mareimorsy3182]

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

[@WebDevSimplified]

I'm glad you enjoyed it!

[@vinamra4893]

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]

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

[@vinamra4893]

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]

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

[@praniltunga]

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

[@WebDevSimplified]

You're welcome!

[@janezklun]

Great topic and nice solution, Thanks

[@WebDevSimplified]

You're welcome!

[@ikramikky2838]

thank you very much

[@WebDevSimplified]

You're welcome!

[@parasarora5869]

great one!!!

[@WebDevSimplified]

Thanks!

[@avagsargsyan404]

Thank you! Great solution!

[@michaelrooze278]

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?

[@BrendanMetcalfe]

Well done!

[@kousalyadevi5209]

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

[@scenesofworld1066]

Also need php tutorials .great work

[@WebDevSimplified]

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.

[@nora8200]

Thank you for this awesome video!

[@hikemalliday6007]

well said and good audio quality

[@manikumarponnuru7271]

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?

[@AhSoh7091]

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]

That is exactly what happens. Good analysis.

[@KhoaNguyen-mv2mu]

beautiful amazing fantastic mind-cracking idea :))

[@dim_1074]

You could also use a trie.

[@BrendanMetcalfe]

Just subbed. Your channel is gold!

[@justcodingandwhatnot9890]

thank you this helped alot !!

[@tannerbarcelos6880]

Vertical method is very intuitive.

[@ibeeliot]

You're dope, brother.

[@Benescoli]

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

[@pushpakgupta7396]

more algorithm videos pls

[@WebDevSimplified]

Will do!

[@DanielLee-rr2qj]

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]

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]

@@WebDevSimplified Ahh got it. Thank you!

[@kumaresanperumal2581]

Does this program use Big O notation?

[@omerm80]

Thank You! just subscribed to your channel:)

[@ibeeliot]

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

[@arunvijay2279]

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

[@luojihencha]

And binary search method man?

[@memeta100]

Thx you got subscription by me

[@usama2576]

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

[@snowsol]

A *P P* L

[@jankidepala]

hair is so distracting :P

[@garrethhynes1201]

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.