finished your 60th video today. Came here to show my support. Please don't be disappointed as the view are declining. Once we finished the other videos, we will come here too. This is the only comprehensive DSA PlayList available on UA-cam. This is much much better than hundreds of paid courses.
Is it just me or with everyone that feels babbar bhaiya is exhausted but still recording the video Bhaiya please take proper rest and then start the course again. We need your full power !!!
Really Enjoyed this. However, one small check to be done for corner testcases: //insert all strings into Trie for (int i = 0; i < strs.size(); i++) { if(strs[i].empty()) // missing check to return in cases where the string is empty return ""; t->insertWord(strs[i]); }
❤💯 already solved trie construction in the morning today of leetcode both recursive and iterative approaches, both were right just by understanding the logic from you... so simple and easily understandable
bhaiya big fan 1 more approach :- sorting karke first and last string compare karenge to ans mil jayega string longestCommonPrefix(vector &arr, int n) { // Write your code here if(n==0)return ""; if(n==1)return arr[0]; sort(arr.begin(),arr.end()); string ans=""; string a=arr[0]; string b=arr[n-1]; for(int i=0;i
We can clearly see how much effort you are putting to provide us the quality content. recording the video half asleep🙂🙂🙂 dedication level is ++ GURU JI ++
maja aa rha hai .. previous day maine leet code , visual code , gfg se trise k question kara ,easy and loving this lecture for me...tq bhaiya for this...
wahh sirr another an exciting session ...wow.....but the second Trie mehtod approach giving TLE at submission time.... but first approach is optimal code solution for this problem...thanks sirrr...consistancy , respect , hardwork , dedication , passion ++++++
My logic was: We can insert one string to the trie, then for rest of the strings we need to check the common prefix, but here must be a catch, [coding, code, codingninjas] -> here ans should be cod, so we need to store the min(ans, tempStr).
#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)
I am really really impressed with the way you teach. Thanks much. I have a question and I hope you wont mind revealing it. Actually I am really very curious to know that how long or how much time do you study in a day?
Just watched video review of your course by @desi coder . My comment there is "Best DSA course on YT🏅🏅🏅" Really Love bhai .. Thanks a lot for putting such an efforts... Don't worry about People getting impatient about the completion of this course. I know this will be completed. Iss level ka content wo b free me ... Hatts offff... Traits of an Army attitude🏅🏅🏅 Love, Abhishek Sharma Punjab
can someone please tell me how much syllabus of DSA is reamining and approximately how much videos will it take to complete,BTW execellent work bhaiya we can see all your efforts❤
Hello Love Babbar sir, Thank you for sharing great knowledge. In this lecture you taught us one brute force solution with O(n*m) time complexity, I found one exception for shared solution, That code is not compatible with test case = [ "ab" , "a" ]. And I found quite better solution for that, which allows almost all test cases. If you allow me I want to contribute that updated code. Thank you.
hi sir i am from andrapradesh (AP)i dont know hindi well i am seeing your videos using subtitles but from past videos onwards subtitles are turned off..can you please turn on for nextvideo on wards
First I have completed all DSA series and now conclude this is Greatest ever DSA series to exists on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇♂ Thanks you.
Bhai aur kitna late karoge yaarrr..... I am following this course from Lecture 1 and here I am after completing all the previous videos...... Please maintain some consistency..... at least 1 vid in 2 days.
hello bhaiya ik this is too late to ask but looks like you were unwell/sick while recording this lecture ,is it true? thanks for the efforts you put for us
Maja aa gya bhaiya 😍😍😍 Finally aap ko catch kar liya course pe Ab aap ke sath daily daily wale video dekhi ga Aur ab hoga practice starting se #reached Lekin bhaiya code link update kar do 😁 Maja bahut aa raha Mera final sem chal raha lekin phir bhi continuous hu aap ke karan Kal mera paper hai 😂🤣😁🤣 You are best 😍😍😍
finished your 60th video today. Came here to show my support. Please don't be disappointed as the view are declining. Once we finished the other videos, we will come here too. This is the only comprehensive DSA PlayList available on UA-cam. This is much much better than hundreds of paid courses.
Is it just me or with everyone that feels babbar bhaiya is exhausted but still recording the video
Bhaiya please take proper rest and then start the course again.
We need your full power !!!
Really Enjoyed this. However, one small check to be done for corner testcases:
//insert all strings into Trie
for (int i = 0; i < strs.size(); i++)
{
if(strs[i].empty()) // missing check to return in cases where the string is empty
return "";
t->insertWord(strs[i]);
}
❤💯 already solved trie construction in the morning today of leetcode both recursive and iterative approaches, both were right just by understanding the logic from you... so simple and easily understandable
bhaiya big fan
1 more approach :-
sorting karke first and last string compare karenge to ans mil jayega
string longestCommonPrefix(vector &arr, int n)
{
// Write your code here
if(n==0)return "";
if(n==1)return arr[0];
sort(arr.begin(),arr.end());
string ans="";
string a=arr[0];
string b=arr[n-1];
for(int i=0;i
consistency vaps le aae ho bht ache bht ache
Attandance ++
Consistency++
Thank you ++
Bhai saab, JOB + Consistency == Faadu 🔥🔥🔥.
Bhaiya, maza aarha h... Coding ab ho rhi h.. Leetcode ke questions bn rhe h..
Happy😁
Credit goes to you ☺
We can clearly see how much effort you are putting to provide us the quality content.
recording the video half asleep🙂🙂🙂 dedication level is ++
GURU JI ++
maja aa rha hai .. previous day maine leet code , visual code , gfg se trise k question kara ,easy and loving this lecture for me...tq bhaiya for this...
JAI SIYA RAM BHAI you are doing tremendous work
Your teaching is really Excellent,
very simple to understand
loving it
consistency++++++++
Jaldi complete krrao bhaiya , mid March ka promise kiya tha apne , abb toh mid Aprila aaagya !!
no one can beat u bhai in teaching and knowledge
I am in recursion .... we all are with you
wahh sirr another an exciting session ...wow.....but the second Trie mehtod approach giving TLE at submission time.... but first approach is optimal code solution for this problem...thanks sirrr...consistancy , respect , hardwork , dedication , passion ++++++
yes it is giving TLE
yayy its showing tle
completed this lecture babbar ji still continuing to complete your whole data structure series !!!!!
Completed 80lectures!! 60 more to go!
int n=strs.size();
string ans="";
sort(strs.begin(),strs.end());
string s1=strs[0];
string s2=strs[n-1];
for(int i=0;i
aaag laga diya bhaiyaa
Back to form..U have given enough upcoming students..❤️
Again out of form ig
Osm content ❤❤❤😊😊
Bhaiya lage raho..hum thoda video peeche hai...aap please Videos banate jao..hum saath me hai aapke ! 🔥
next level efforts
🔥🔥
Thanks for this awesome series sir
Make playlist for and Trie.
Enjoyed a lot... Thanks for making such a quality content ❤️❤️
Krenge bhaiya ....aap ho toh mumkin hai
Thank You So Much BHRATA SHREE !!!!!!!
My logic was: We can insert one string to the trie, then for rest of the strings we need to check the common prefix, but here must be a catch, [coding, code, codingninjas] -> here ans should be cod, so we need to store the min(ans, tempStr).
#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)
I am really really impressed with the way you teach. Thanks much. I have a question and I hope you wont mind revealing it. Actually I am really very curious to know that how long or how much time do you study in a day?
This series is helping alot❤❤👍👍😊😊
Thanks Bhai, these tutorials really helped me all these times.
Attandance marked now solving stack questions Josh is high
kk luv u bro good job MAKE Your FAMILY HAPPY AND SATISFIED WITH WHAT YOU DO
Thanks A lot BHaiya.......RESPECT++;
Consistency 😍 thank you for the course👏
Love you bhaiyya ❤️😘....thanks a lot for this.....please don't change bhaiyya.....love youuuuu
Just watched video review of your course by @desi coder . My comment there is "Best DSA course on YT🏅🏅🏅"
Really Love bhai .. Thanks a lot for putting such an efforts... Don't worry about People getting impatient about the completion of this course. I know this will be completed.
Iss level ka content wo b free me ... Hatts offff... Traits of an Army attitude🏅🏅🏅
Love,
Abhishek Sharma
Punjab
I am from punjab as well..
Which district by the way?
@@bhawargujral3574 Hoshiarpur bro ... 🤝
Present bhaiya ✋
congratulations you have been selected amongst our shortlisted winners ✅
A direct message 👆
we can use linked list as well
Hope to greet you someday after getting placed
can someone please tell me how much syllabus of DSA is reamining and approximately how much videos will it take to complete,BTW execellent work bhaiya we can see all your efforts❤
Dont worry bro i think there will be little topics like - DP and graph mostly
thanks bhaiya crystal clear hai
are mjja aa gya
great explanation...thank you so much for making our path easy
thank you bhaiya 😇😇🙏
Hello Love Babbar sir, Thank you for sharing great knowledge. In this lecture you taught us one brute force solution with O(n*m) time complexity, I found one exception for shared solution, That code is not compatible with test case = [ "ab" , "a" ]. And I found quite better solution for that, which allows almost all test cases. If you allow me I want to contribute that updated code. Thank you.
can you share your solution here?
Bhaiya os ki trh dbms Or cn ka series bhi start kariye please bhaiya humble request... 🙏🙏🙏
I trust you Babar thanks 👍
💯🙏Bhaiya lecture 17,18,19 .. etc ke handwritten notes bhi daliye plz🙏❤
Sir amazing video
Great explaination
Easy and Smooth!!💯
hi sir i am from andrapradesh (AP)i dont know hindi well i am seeing your videos using subtitles but from past videos onwards subtitles are turned off..can you please turn on for nextvideo on wards
Video late aayegi chalega btt health comes first take proper rest and care bhaiya.
Bhaiyaaa tussi great ho 💓💓
Thank you bhaiya😄consistency OP🥰
congratulations you have been selected amongst our shortlisted winners ✅
A direct message 👆
Thanku for making great videos bhaiya
thanx:)
Thanks alot bhaiya.. consistency++
Bhaiya we are with you..
Thank u bhaiya for your efforts
Will this course continue
160 ✅completed 👍Liked 2:30
bhaya video dalo jaldi
cover karliya hai saara
while(1)
{
love Babber;
}
Hanji 🎉
Lecture was amazing sir!
Mza aagya bhaiaya
congratulations you have been selected amongst our shortlisted winners ✅
A direct message 👆
keep it up
First I have completed all DSA series and now conclude this is Greatest ever DSA series to exists on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇♂ Thanks you.
Bhai aur kitna late karoge yaarrr..... I am following this course from Lecture 1 and here I am after completing all the previous videos...... Please maintain some consistency..... at least 1 vid in 2 days.
bro unka job bhi h, thoda unke bare me bhi socho.... waise hi clear dikh rha h ki wo kitne thke hue h.. phir bhi kr rhe h.
Pls tell@Love babbar total kitni video aaygi DSA course mein pls ek idea bta do🙏🙏🙏🙏🙏🙏
Having problem to solve more problem anyone suggest me where i can ask my doubt ,any whatsapp group or discard server
hashmaps ke question karao
hello bhaiya ik this is too late to ask but looks like you were unwell/sick while recording this lecture ,is it true?
thanks for the efforts you put for us
maza agya
Thanks for your affort
maja aa rha
Bhaiya moj kr diii
thank you bhaiya
kadak
Os is of bohot confusion hua isse
It will be less than equal to
Is there any more optimzation in this like some people have used sorting
Yes sir hum kar rahe hai abhi se
bhaiya.. what will be the Longest Common Prefix for ["flowering" , "flringow" , "flringight"]
ans..fl or ring?? please resolve this confusion!!
it should be ring , as it is "longest common"
The correct ans is fl
Reason is- question is about the longest common prefix and not longest common substring
@@hiddenmaster1724 why ring is not prefix ?
@@GrindMachine89 Prefix occurs at the beginning of root and not in between. "Ring" is a sub-part/sub-string.
@@hiddenmaster1724 flringow and flringight has ring in first part only
Bhaiya lecture 81 kab ayega
Mza++
is terminal helps edge cases like CODECHEF CODE we need as as 4 and not 7
Maja aa gya bhaiya 😍😍😍
Finally aap ko catch kar liya course pe
Ab aap ke sath daily daily wale video dekhi ga
Aur ab hoga practice starting se
#reached
Lekin bhaiya code link update kar do 😁
Maja bahut aa raha
Mera final sem chal raha lekin phir bhi continuous hu aap ke karan
Kal mera paper hai 😂🤣😁🤣
You are best 😍😍😍
i'm making my attendance for today..
congratulations you have been selected amongst our shortlisted winners ✅
A direct message 👆
Code here : leetcode.com/problems/longest-common-prefix/discuss/2659408/cpp-trie-love-babbar-approach
Thanku Sir🙏
thx sir 🙏
Can I get loan zero interest to buy new laptop ...need it badly now ....