You always provide the best, easiest, and simplest approaches. I watch your explanations and then try to write the code independently, and I succeed most of the time. Keep making such great content. It really helps us a lot.
@nikoo28
9 ай бұрын
that is so nice to hear. I hope to keep bringing quality content for you guys.
@ajaysaran6541
21 күн бұрын
When i saw the optimized solution, i really amazed. Thanks for helping in learning journey. 15mins completely worth it.
@bivashroy2829
Жыл бұрын
If the string contain a mixture of capital and small letter then sorting can't be the solution... string commonPrefix(vector& strs,int n){ string s1 = strs[0]; int ans_length = s1.length(); for(int i = 0 ; i< n ; i++){ int j = 0 ; while(j
@quantisticnumbers2633
Жыл бұрын
Definitely one of the easiest and best solutions that I came across. Thanks for the video!
@satyamgupta6030
Жыл бұрын
great teaching bhaiya. I always look for ur videos whenever I search for a solution of a leetcode question. No one comes close to you when it comes to explaining multiple approaches and finally solving with the most optimal approach . Thanks bhaiya.
@nikoo28
Жыл бұрын
It's my pleasure
@quartekstudio8127
6 ай бұрын
I was stucking this question for 4 days by watching many of videos but I can't find out the best way to answer this question. But you did and explain it really well. I know I'm not that good as problem solving but you are the one who can explain the concept from really hard to a really human can understanding really easy
@officialdreamplayz
6 ай бұрын
how many questions u have conquered till now i m on 4th (easy)
@quartekstudio8127
6 ай бұрын
@@officialdreamplayz just only 6-7. We are going slow because I think we are missing something or some concept to answer or design to answer the question. I think keep doing it will help us a lot. For me answering in Code war was really easy more than leetcode
@nikoo28
5 ай бұрын
all the very best...and glad to see your progress
@kamleshkumarsingh5140
6 ай бұрын
SC will be O(n) right for using stringbuilder?? Great explanation though
@nikoo28
5 ай бұрын
you are absolutely correct. My bad..the space complexity will be O(n)
@nginx.h
Жыл бұрын
bro i stuck at this problem and i dont understand how to solve this question but after watching some video i not getting it better but u solve this question with very simple approach. 👍👍 well done bro
@englishpopop7694
11 ай бұрын
this breakdown made things much more clear and easy to comprehend
@kunalkheeva
2 жыл бұрын
your videos seem like bit longer, but its really very productive, I couldnot even skip it for a sec, just great work!! Thank you!
@nikoo28
2 жыл бұрын
I really try to go over the concept, rather than just giving away the code...the same you would be solving a problem in an interview. Thanks for your support. Much appreciated. 😄
@bxp_bass
Ай бұрын
That optimization only works in python or other interpreted languages, where sorting is much cheaper than a loop. In golang or c or c++ it's much faster to do loops, so you don't need to spend O(n log n) on sorting
@sumanthpai4587
9 ай бұрын
Very Articulately explained . with proper animations etc , really good job
@CostaKazistov
2 жыл бұрын
Great style of teaching algorithms. 10/10 👍
@user-fx1kt1ev2b
Жыл бұрын
Great explanation, but I would add a check for potential issue where an Index error can occur if the first and last strings in the strs array have different lengths. Like this: min_length = min(len(first), len(last)) for i in range(min_length)
@nikoo28
Жыл бұрын
Sure, you can do that
@enriquegrageda
7 ай бұрын
My bro, you are a great teacher!
@HY-eu4ei
Жыл бұрын
tried a lot of videos and i would say this was the best explanation of all such a easy and elaborative explanation. thank you
@nikoo28
Жыл бұрын
Glad you feel this way ♥️
@shivanijain2192
Ай бұрын
what is the time complexity of brute force. And Sorting must be also compare all the characters internally then just wondering how it is optimized solution
@subhamagarwal476
2 ай бұрын
addicted to your channel. You explain so simple and in easy way. Thanks a lot
@himadripaul7332
2 жыл бұрын
excellent this channel will grow gradually ..no bakwas straight forward explanation ..
@tashi7316
Жыл бұрын
So far one of the best solution I have seen
@erenyeager4452
Жыл бұрын
Hey, found a similar problem but no one had a good solution online. The idea is to find the longest palindromic prefix. Would help a lot if you can make a video on this. thanks for the videos. love them.
@zack176
Жыл бұрын
Wow so you are finally tired of destroying world
@spongebobsquarepants4576
2 ай бұрын
Interesting solution with sorting - but then you get n*log n. You can simply search the list for the shortest word and then compare it with all other words, thus making it O(n * k) where k is the length of the shortest word. Depending on the input you have in a real life scenario, your approach might be more efficient if the strings are very long, so if the length of the shoertest string k > n where n is number of values in the list, then your approach is more efficient. Anyway cool explanation thanks!
@ronakpatel2826
3 күн бұрын
string longestCommonPrefix(vector& strs) { int mini=INT_MAX; int ind=-1; for(int i=0;istrs[i].size()){ mini=strs[i].size(); ind=i; } } string ans=strs[ind]; int j=mini-1; while(j>=0){ int k=0; //bool isOk=true; //cout
@raghavkaushal7561
2 жыл бұрын
Thank you so much brother!!! Your explanation is extremely simple to understand and follow. Wish I had a teacher like you.
@niteshpandey8207
Жыл бұрын
Esko dekh ye pta chala ki aise bhi question solve kr sakte hai.... keep posting
@nikoo28
Жыл бұрын
😄
@s.harishkumar3087
Ай бұрын
I understand this problem with your explanation Easily❤
bro can you explain why we go with first and last and explain why can't we go with first and second string
@kirankutte7073
2 жыл бұрын
Awesome explaination. I liked the slow and animated explainartion. Good job!
@nikoo28
2 жыл бұрын
Glad you liked it
@candichiu7850
2 жыл бұрын
Thank you! The BEST on KZitem. Super explanation.Keep up the great work.
@PankajYadav-nz4gn
2 жыл бұрын
Oh My GOD!!! I can't imagine that someone can be this good in explanation. Amazing and super thanks.
@nikoo28
2 жыл бұрын
Wow, thanks!
@rishidangi2978
6 ай бұрын
don't you think that for loop should also have the condition "&& i < last.lenght()" as if the first array has length greater, then it would also check that index char for the last array, which would result in "IndexArrayOutOfBonds" exception like the example: canada, car, czech (sorted) here the first element would have the length 6, so the for loop would also run for the value i = 5, but the last[5] doesn't exist
@rishidangi2978
6 ай бұрын
ok so I came up with the answer, its because the traversal of the string would just stop before it hits index more than the last element, correct me if i'm wrong
@nikoo28
6 ай бұрын
absolutely correct
@egm5081
7 ай бұрын
man, what amazing explanation, thank you so much!
@jatinkumar4410
2 жыл бұрын
Hello... Nice and clear explanation. But i have a doubt. Shouldn't the time complexity of efficient approach be: O(n*s*log(n)) (where n: length of array and s: average length of string) Instead of O(nlogn) (13:52) . If that is the case, then time complexity of brute force would be better than this approach. Isn't it? Also aren't we going to consider space complexity taken by sorting algo internally?
@sasidharnaidu4507
5 ай бұрын
Yeah, you are right. The brute force approach is even less time consuming when the initial chars of the words won't match.
@Prince-fv8mb
Жыл бұрын
loved the way you explained sir.....This channel is highly underrated
@nikoo28
Жыл бұрын
Thanks for your support and motivation. I really hope the youtube algorithm picks up the channel soon 😅
@huquea
2 жыл бұрын
OMG, you took teaching algorithm to next level
@nikoo28
2 жыл бұрын
So happy you feel this way 😄
@Ishankulkarni
4 ай бұрын
The efficient solution isn't in fact the most optimal, sorting strings is not nlog(n) but the worst-case & average time is n^2log(n). Only in the best case where the first characters of the string do not match, the TC becomes O(long(n)).
@nikoo28
4 ай бұрын
you are correct...happy to talk about an even more optimal solution if you have to bring up 🙂
@amolgawai010
2 ай бұрын
Great Explanation, small correction: Space complexity is O(n)
@nikoo28
2 ай бұрын
we aren't using any extra space to arrive at the solution
@aryasharma69
14 күн бұрын
@@nikoo28 but we are using string builder it has the property to store n elements so the overall space complexity will be O(n)
@sharcodes
Жыл бұрын
Love your Solution. Best Wishes for You. I Would Love to see your Channel Grow, why this is so Underrated.
@nikoo28
Жыл бұрын
Thanks for your support and motivation. I really hope the youtube algorithm picks up the channel soon 😅
@gopro12378
Жыл бұрын
Crystal clear concept thank you sir!
@mdrabby1259
Жыл бұрын
Very good explanation ❤😊
@saiyamjain6099
2 жыл бұрын
Excellent explanation 🔥 keep making more videos loved it
@nickjr9994
Жыл бұрын
Very good explanation brother. This solution was so precise and easy to understand. Thanks a ton
@nikoo28
Жыл бұрын
glad you liked it.
@MaksymKondratiuk
7 ай бұрын
Thanks for the video. But in the end, it looks a bit confusing. The time complexity of the "brute force" approach should O(n * m) where m is the length of the string and in the case of the "efficient approach" we will have O(n * m * log n) which is slower than the previous one. Is it a case or did I miss something?
@Ishankulkarni
4 ай бұрын
You are correct
@sahilbait2981
Ай бұрын
Please make a video on Repeated String Match question
@d54nirajthakare69
2 жыл бұрын
The level of Explanation I saw today was amazing !!!
@nikoo28
2 жыл бұрын
So happy you felt that way
@user-ig2kt4jp8i
11 ай бұрын
You're such a good teacher. Thank you!
@nikoo28
10 ай бұрын
Glad you think so!
@AvinashKumar-ps4tw
Жыл бұрын
Very Crisp and interesting explanation
@muhammadmahbub6462
4 күн бұрын
Thanks for the clear explanation. but i have solved using php😊
@CodingJourney-sz3og
7 ай бұрын
i have a query , why we are comparing rhe first and the last string in the efficient solution after sorting the strings .. after sorting even first two strings can give the solution
@officialdreamplayz
6 ай бұрын
clever clue deliver now compare 1st and 2nd 😂
@rishidangi2978
6 ай бұрын
first and the last string will have the maximum possible difference, while first and second will have the minimum difference as they're sorted
@punamroy6639
Ай бұрын
great explaination. Thank you
@amitshukla2268
10 ай бұрын
Hey Bro really thanks, wanna give a suggestion, please use dark color in ppts.
@nikoo28
10 ай бұрын
i prefer while, as it gives an experience with whiteboarding as well. You will be doing a lot of whiteboarding in any organization. 😄
@aradhyashukla2813
Жыл бұрын
Explained a complex problem very easily 💯👏
@aparna5778
4 ай бұрын
Thanks for the explanation. Was easy to follow.
@ChaitanyaPimparkar
2 жыл бұрын
keep them coming
@munzirahmed6424
5 ай бұрын
#this code for #python. def pre(a): a.sort() first=a[0] last=a[-1] out="" for i in range(len(first)): if first[i] == last[i]: out+=first[i] else: break return out print(pre(["flower","flow","flight"]))
@Abhishek-ji6qj
Жыл бұрын
#python:- x = ["flower", "flosing", "flowing"] prefix = "" for i in range(len(x[0])): flag = 0 temp = x[0][i] for j in range(1, len(x)): if not x[j][i] == temp: flag = 0 break else: flag = 1 if flag ==1: prefix+=temp else: pass print(prefix)
@amitarajput1153
Жыл бұрын
Best Teacher. Please upload more videos. Super thanks
@denisgordiy5718
Жыл бұрын
Thank you for great explanation. IMHO more efficiently is not to use StringBulider but just return first.substring(0, index)
@nikoo28
Жыл бұрын
The difference will be very minute. :)
@kidoo1567
10 ай бұрын
Asusal nikil is on fire❤
@shivenderkumar4521
2 жыл бұрын
Very Simple and clear explaination , Thank you ❤
@myosith4795
5 ай бұрын
In the Arrays.sort method going to iterate every element so we can iterate these elements we can avoid use of Arrays.sort method 😊
@animationTip
2 жыл бұрын
I love the way of explanation.Thank u so much making such a video bhaiya .
@Chhooso
7 ай бұрын
Finally was able to understand it😭👍
@chakri2622
Жыл бұрын
this video made to subscriber to never loss hope and don't give up u will grow
@sarthakbhargava3514
Жыл бұрын
Thanks
@curiousvaita
3 ай бұрын
Amazing Solution. Thanks a lot.
@yashgoel1894
4 ай бұрын
class Solution{ String longestCommonPrefix(String arr[], int n){ StringBuilder result=new StringBuilder(); Arrays.sort(arr); char[] first=arr[0].toCharArray(); char[] last=arr[n-1].toCharArray(); for(int i=0; i
@Chathur732
8 күн бұрын
Wonderful!!
@SMARTRIXDbztttmods
Жыл бұрын
*Excellent Work 🔥Thanks Sir*
@AmeyBhogaonkar-vy2bx
3 ай бұрын
Worth it !!
@hemant8762
10 ай бұрын
Thank you so much sir
@keshavkaushlya8355
Жыл бұрын
if possible try to show the code for brute force approach also, this helps in understandig the problem in a much better way,btw doing great work,appreciated.
@nikoo28
Жыл бұрын
thanks for your feedback and support :)...but usually coding for brute force is not desirable...i only do that in scenarios when you tweak a brute force approach to convert it to an optimal solution.
@saurabhsaxena8470
Жыл бұрын
In actual interviews, should we just explain the brute force solution and code only the optimal solution or try to code both?@@nikoo28
@SouravCheck
4 ай бұрын
2:07, A is also a counted in prefix?
@eyerahulk
11 ай бұрын
Nice explanation, thanks man.
@voidcrs
5 ай бұрын
This is a great solution.
@priyanshugurwani8021
2 ай бұрын
How th espace complexity is O(1) , we are using stringBuilder here
@devxbasit
10 ай бұрын
helpful, I just wanted to directly jump to the time complexity timestamp, but could not find it
@nikoo28
10 ай бұрын
check the video description please.
@rishabhjain7651
Жыл бұрын
love to way of explaination 😍
@SaumyaSharma007
Жыл бұрын
Thank you brother 🙌
@DalisYn
Жыл бұрын
Thank you so much this one was a bit confusing
@parulsaraogi6770
Жыл бұрын
Woww explained so well.. just loved it 🥰❤️
@LuckyAndDad
Жыл бұрын
Excellent narration
@anshikagarg9485
2 жыл бұрын
I can't think... Thanku for this optimal approch
@TemuriChitashvili
5 ай бұрын
Really good.😉
@debasmitadash9974
10 ай бұрын
You are amazing. ❤
@nikoo28
9 ай бұрын
You're the best!
@siddhigolatkar8558
8 ай бұрын
Thank you
@vm1662
Жыл бұрын
Great explanation! Thank you. :)
@muskancreativity7
2 жыл бұрын
Best explanation 💜
@nikoo28
2 жыл бұрын
Glad that you feel this way :)
@abhijitbiradar
Жыл бұрын
very nicely explained. thanks
@PranitKothari
Жыл бұрын
You explain nicely!
@md.shimul4805
Жыл бұрын
Thank you so much!!!
@simo_the_goat
9 ай бұрын
nice job
@abhiramsathiraju6276
11 ай бұрын
Can we optimize it further and make it O(N) ??? Help me if anyone know how to do that!!
@shwetayadav4244
7 ай бұрын
but what about the complexity since we are applying in-built sorting
@nikoo28
6 ай бұрын
it will be O(n log n)
@salmarafiq7695
2 жыл бұрын
Amazing explanation!!!
@anshikagarg9485
2 жыл бұрын
Awesome👍👍
@ashish4k07
8 ай бұрын
Can O(n) be possible like finding the max lengthed word and least lengthed word and compare them just the doubt
@nikoo28
8 ай бұрын
Try writing a pseudo code for it
@subee128
8 ай бұрын
Thank you very much
@nikoo28
8 ай бұрын
Any time
@VaibhavSingh-kh3jr
4 ай бұрын
Maza aayega ❤
@mozsty
3 ай бұрын
so what if club is the first word and there is another word clubt
Пікірлер: 225