Longest Common Prefix | LeetCode problem 14

[@srinivaschalamalasetti1877]

super explanation and information also...

[@memehhme]

Mam.... The last condition should write out of the while loop am I right?.. Based on ur code then index may vary

[@tricksforsolving2804]

yes ,but how its executed there ?

[@shindeprem228]

@@tricksforsolving2804 I also have same doubt , but I think she paused the video and then corrected it. Anyways nice explanation

[@extraalt]

yes or it just returns at first iteration

[@nimishjaitapkar3492]

How is this program working with the return statement inside the while loop? 🤔

[@NidhiKamble-yw2lj]

Correct explanation

[@tusharprajapati2574]

I love your approach miss!!

[@Saurabh-fe2bg]

how did you enable the debuger? I am interested to know bc when you debug you get really good at coding logics and loops thoroughly

[@eshikarya]

You get a bug like icon in IntelliJ, that's the debugger. The first step is to apply breakpoint(s) at the line(s) of code you want to check. For example you have a loop running which prints # from 0 to n. You want to check what is going to be the print value before it's actually printed; put a breakpoint at that line and use the debugger feature step over. (There also exists step in and step out --- explore these). Right click on the code and you'll find debug option right below "run program" It took me a while to learn how to debug EFFICIENTLY, since a good debugging in my opinion is when minimum # of required debug breakpoints are put in a program. You can learn by starting to debug very simple programs (like sout("hello word"));) and then moving on to more complex programs. That's how I learned. And I agree, as a professional software engineer I can assure you a developer isn't someone who just writes and gets done with the code. Debugging will teach you more about code logics and program flows than anything else ever will. Hope this helps and answers your question? :)

[@vageeshramesh4048]

Good explanation!

[@sujatamahata3128]

Very nice explanation

[@ramineninagajaswanth6476]

Can we do it in O(n)?

[@deepakgaroda975]

Nice Explanation

[@oorja1983]

Thnx.... nicely explained

[@mitaalisinghal8932]

Nice explanation Thank You !

[@TechnosageLearning]

Glad it was helpful!

[@start1learn-n171]

Tq😊

[@kadamsatyajit]

good explanation

[@mpbe]

what about this case : ["abc","xyss","abcdefgh"] expect = "" output = "abc"

[@TechnosageLearning]

Output would be an empty string in this case...because abc is not common prefix in all three strings..It should be there in all strings then only it would be considered as common prefix..

[@mpbe]

@@TechnosageLearning but the code that you taught, is not submitting successfully

[@Onesided.x]

​@@mpbebro array ko sort karenge toh ab ab se start hone wali string pehle aa jayegi or xy se start hone wali string last me aa jayegi toh comparison first string or last string ka hoga toh koi character match nhi hoga toh output empty string hi aayega na

[@sauravclark]

@@Onesided.x isko check karo then, is it working? Leet code accept nahi kar raha , q ki is logic se dekhe to original array = ["dog","racecar","car"] sorting ke baad = [car, dog, racecar], to comparison first string aur last string main hua to answer car aayega as common prefix , but car dog main to nahi hai , fir? isliye leetcode main submit nahi ho raha .

[@AdarshPKumar]

for test case ab , a it will go out of bound how do we solve it

[@eshikarya]

while(index

[@saikiran-em8gw]

What if [ cr, c , crc]....in this case,after checking 1st and last string common letters will be cr,but middle string contains only c...how its works with ur logic?

[@mohittiwari6994]

to uspr sort v to lagyga n to fir [c, cr,crc] ho jyga

[@SarthakKumar]

time complexity will be nlogn because we are sorting the array right?

[@TechnosageLearning]

Yes it would be logarithmic time Complexity..By mistake, I have mentioned as O(n)....I will correct it. Thanks for pointing it out.

[@DhairyaAgOfficial07]

Mam please start uploading videos again, your videos really helps

[@inspirationalquotes5840]

substring(0, index +1) NOT substring(0, index)

[@extraalt]

wrong

[@ec072nikitavishwakarma7]

Thankyou

[@meenanandhini]

mam can you explain how will you give user input using scanner class

[@mohitvashisth2933]

import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner input = new Scanner(System.in); int n = input.nextInt(); String words[] = new int[n]; for(int i=0; i

[@meenanandhini]

@@mohitvashisth2933 thank you

[@karanjitrandhawa1515]

Understood Maam, Maam can you please guide me. I am ready to do hard work and doing also one thing i need the most is the guidance please

[@TechnosageLearning]

Sure...Keep going..Let me know if you need any help

[@arifmd8940]

Wrong code, it will only work for the first two strings in that array. Its going to ignore the rest of the strings in that array

[@ayanchakraborty3067]

In the run time it is showing missing return statement

[@TechnosageLearning]

class Solution { public String longestCommonPrefix(String[] strs) { Arrays.sort(strs); String str1 = strs[0]; String str2 = strs[strs.length-1]; int index =0; while(index

[@Yogesh-ei1lg]

@@TechnosageLearning Yeah, that's perfectly fine. In the video, you are also using main function that is why the return statement needs to change its position according toh the situation.

[@abhinavpatil2114]

genius

[@AdarshPKumar]

this will fail after the 6th test case in leetcode

[@ashishnannaware7349]

what if array=["Thik","kuchh nhi","Thik h"] as per your code output is => Thik but output will be "" (blank)

[@tanyamodi9233]

first sort the array, once it is sorted it will give correct output

[@Aman-dh9wz]

Bro you got ur answer.?

[@Aman-dh9wz]

​@@tanyamodi9233sort karenge to 1st string me ["kuchh nhi"] and last string me [" thik hai "] .. & Then if compare so output will be " ". Na .?

[@deepakmodi927]

public String longestCommonPrefix(String[] strs) { Arrays.sort(strs); // sort the array of strings String first = strs[0]; String last = strs[strs.length - 1]; int i = 0; // find the common prefix between the first and last string while (i < first.length() && i < last.length()) { if (first.charAt(i) == last.charAt(i)) { i++; } else { break; } } return i == 0 ? "" : first.substring(0, i); }

[@sauravclark]

​ @Onesided.x isko check karo then, is it working? Leet code accept nahi kar raha , q ki is logic se dekhe to original array = ["dog","racecar","car"] sorting ke baad = [car, dog, racecar], to comparison first string aur last string main hua to answer car aayega as common prefix , but car dog main to nahi hai , fir? isliye leetcode main submit nahi ho raha .

[@pranavjadhav1987]

racecar me car suffix he prefix nahi he

[@kulkarniprabhakar290]

Just a little improvement: while(i < str1.length() && str1.charAt(i) == str2.charAt(i)) { i++; } return i == 0 ? "" : str1.substring(0,i); make it more simple like this

[@shruuuuuuu21]

Nice bro good logic