You might not have enough views or subs. But trust me soon you are gonna be the stack overflow for beginners on youtube and your channel will explode in this upcoming tech era. ❤️ Keep grinding ❤️ Thanks ❤️
All are best in their own ways. Shaurabh shukla for c/c++ java,php,mysql, Traversy for javascript and web development as a whole. Harry Bhai for every thing ... Literally everything.
When you go to sleep: CodeWithHarry uploaded a new video When you wake up: CodeWithHarry uploaded a new video Such a hardworking legend Thanks Harry Bhai
You are a very hardworking person and your channel deserve 1 million subscribers From this video I clearly understand the concept of infix to postfix 😍😀😀 Thank you!! 🙏🏻🤗🤗
this is a very nice problem to solve using stack. seems very non intuitive at first and takes some time to set in, but it was explained wonderfully through lecture 36 and 37. thankyou sir!
I was going through a Facebook group of programming in which a newbie posted to suggest a channel to learn programming,!! Guess what! Most of the comments was code with harry❤️ You're getting famous bro!!
Hello Harry bro.... Wordpress ki 3 ghante ki series aapki dekhi..bahut acchi. .aesi video nahi dekhi..good work..and special Thanks 😊 You... Bro..image website ke liye ek template suggest kar sakte ho to batana...
20:20 Apne to pichle video me bataya tha ki agar less ya equal precedence hogi to top se neeche tk jab tk precedece zyada nahi hoti sabko pop krenge..... Lekin ye code to bus pehle ko check krta h
there is correction in your code @codewithharry at 20:25 inside else statement... because in that else statement you are just poping the top of stack into postfix Exp when its precedence is greater than infixExpression[i] ..but you also need to push infixExpression[i] after poping the top but you are not doing it..below is the modification i think is needed if (precedence(infixExpression[i]) > precedence(stackTop(operators))) { push(operators, infixExpression[i]); } else { while(precedence(infixExpression[i])
You really don't need to do that much lol. All you need is an extra else case after precedence check which checks if the stack is empty or not. If the stack is empty, then just push whatever operator is there in the infix. Done.
Children do not understand whether to take computer engineering or artificial intelligence engineering. Which one to take? And if you want to take artificial engineering, is it difficult for them? Please make video on prerequisite for artificial intelligence
You haven't discussed about precedence of power (^) operator in this lecture kindly explain the implementation with that operator too. Associativity changes in case of that operator.
I was sooo tense to continue programming as courses at uni buttt these videoss are Amazinggg Sirr, and the you teach every thing is outstanding Allahbless u ,love from pakistan❤
int stackTop(struct stack* sp){ return sp->arr[sp->top]; } In infix to postfix conversion here it should be char or int in stack top?I am bit confused?
bhai awesome!!!! but i have one question...postfix ko prefix me ,prefix ko postfix me....postfix ko infix me ,prefix ko infix me convert krne nahi bolenge kya kabhi....aur infix ko prefix me convert kaise krna hai stack se ye nahi cover kiya aapne....kuch karne vale ho kya ?
When I see those kids coding on white hat Jr with Rs. 700/ class I feel like laughing. They are all wasting thier money when there are 100x better classes with more details on code with Harry. 😆😆
@@rishabhinc2936 baat toh sahi hai dekho jo pay karke dekhega woh uski marzi aur jo youTube se karna chahta hai woh uski marzi hum kaun hote hai kehne wale....bass usse aur hume samajh me aana chahiye lekin ye log nahi samjhenge
For infix to prefix you have to reverse the infix expression then do its infix to postfix conversion then again reverse the result you'll get the prefix expression
Why is there a need of instance of stack in this program at 25:40 whereas in the previous code (parenthesis matching) stack instance was not required ??
GM Harry bhaei please flutter or dart pay vedio bna do Hindi k sare vedios TH-cam k samj nhi ate buss Aap k vedios ascche say smaj ate heai Or Maine aapke c python or Ab Java k vedios dekhi hu Please sir flutter pay vedio bna do Hindi may
Harry Bhai thanks for this wonderful video. I'm stuck in how to put condition for braces please suggest something or reply a code snippet for my query. Thanks
At 20:13 in line 81 you made a mistake, you have used 'else' and in it you have popped from stack if precedence of stack top is greater, but after that you will also have to push the infix expression's operator into the stack. That's what you explained in your last video that if the stack top's precedence is greater or equal to infix operator then we will have to pop the operator until stack top is lower than infix operator and then push the infix operator into the stack. Look into it and correct it please.
i think it works fine and its because we didn't increment i so that character is going to be checked again and this time it will be pushed. maybe i am wrong. plz do correct me if thats the case
@@little_riddler else if(s.at(i) == '+' || s.at(i) == '-'){ if((str[top] == '+' || str[top] == '-' || str[top] == '*' || str[top] == '/') && (top != -1)){ while(top != -1){ p[j] = pop(); j++; } push(s[i]); } else { push(s[i]); } } Here I didnt used the precidence but i created it in my way I hope it will be useful to you
You might not have enough views or subs. But trust me soon you are gonna be the stack overflow for beginners on youtube and your channel will explode in this upcoming tech era. ❤️ Keep grinding ❤️ Thanks ❤️
Stop beating the bush just checkout 👩🏻🚀🚀 other channels like Saurabh Shukla, Traversy Media.
@@shubhendubose8884 I find this one better than the ones you mentioned
All are best in their own ways. Shaurabh shukla for c/c++ java,php,mysql, Traversy for javascript and web development as a whole. Harry Bhai for every thing ... Literally everything.
The one who makes you understand is best. Agree?
For me, whenever I stuck at programming, I watch Harry videos
but he has now millions of subscribers and view Ma Shaa Allah
When you go to sleep: CodeWithHarry uploaded a new video
When you wake up: CodeWithHarry uploaded a new video
Such a hardworking legend
Thanks Harry Bhai
Bhaiya Notes kse milenge ??
@@ARVINDKUMAR-od9up check description
Consistency, hardwork, techniques, this all will get you 1 million soon ❤️
now he has nearly 4 million subs 😄
5 millions
now 6.7M
@@rameshchandsharma5049 arey haa tum bhi DSA karne aaye ho kya bhai?
@@divyanshtripash5485 yes bro
You are a very hardworking person and your channel deserve 1 million subscribers
From this video I clearly understand the concept of infix to postfix 😍😀😀
Thank you!! 🙏🏻🤗🤗
You are doing a good job. Never stop giving your content for free.
Bahut interest aa rha h saare videos dekhne m....Thankyou Harry Bhai for putting so much efforts for us...You are a God!!
This was never so easy in 3yrs of my college..#itnaHiAasaanTha.. Thanks Harry ✨.. I was able to learn stack jst becoz of you ❤️..
Harry Bhaiya ...Mujhe aapse inspiration milti hai aur mehnat krne ki.....Thanks bhaiya :)
Thanks for amazing playlist for ds 👍🏼👍🏼👍🏼👍🏼👍🏼👍🏼I m learning From starting 👍🏼👍🏼👍🏼👍🏼
The way you taught
really superb
That view of white pen on black screen in the beginning looks AWEsome !! 😍
Harry sir you deserve only respect and love from begginers like us, salute to you
not money ? lol
@@ravikantamal7163 sorry, YES he indeed deserves money 💰🤑😊😊😊😊
sir you are the best programing teacher i have ever seen
9:40 bhaiya while loop use kro popping ke lie coz more than one operator pop krna pad sakta hai
I like your good and easy teaching techniques. You are a very good programmer and teacher. Thank you for your efforts and helps.
🙏😊
this is a very nice problem to solve using stack. seems very non intuitive at first and takes some time to set in, but it was explained wonderfully through lecture 36 and 37. thankyou sir!
Harry sir isse acha content milega hi nhi 🎉 , great work 🌈 great explanation 🙏🏻🙏🏻🙏🏻 , thanks a lot ❤️
harry bhaiya, code ke syntax kuchh bhi samajh nahi aaye bas dekh dekh kar code likh diya...ye code out of mind chala gaya pura
Bohut jada maja ayaa heh harry bhi ajk ki video meh.. isko code me convert korna to or bhe maja dar tahh
You are superb...sab samaj aata he aek hi bar me....you have great teacher..
Congratulation for 600k subscribers
Thanks Harry Bhai.
Mast samjhaya bhai.
❤
I was going through a Facebook group of programming in which a newbie posted to suggest a channel to learn programming,!!
Guess what!
Most of the comments was code with harry❤️
You're getting famous bro!!
Finally harry bhai ke samjhane ke baad yeh topic samajh aaya 🎉❤
Harry Bhai, your way of coding is awesome 😍💯
Hello Harry bro.... Wordpress ki 3 ghante ki series aapki dekhi..bahut acchi. .aesi video nahi dekhi..good work..and special Thanks 😊 You...
Bro..image website ke liye ek template suggest kar sakte ho to batana...
Congregation 600k..... 🇧🇩🇧🇩🇧🇩🇧🇩✒✒
20:20
Apne to pichle video me bataya tha ki agar less ya equal precedence hogi to top se neeche tk jab tk precedece zyada nahi hoti sabko pop krenge.....
Lekin ye code to bus pehle ko check krta h
Thank you harry bhai for explaining this problem in such an easy way.
Hats off to you.
😍😄
Congratulations for 6lakh Subscribers
1 view ...................
1st comment .......
1st like....................
(For my great Harry sir 💐😍😍❤️❤️)
congratulation for 601k subscribers
Thanks Harry bhai bht achese smjhaya
You are Awesome Harry bhai.Just a brilliant stuff.Plz upload 2-3 videos from DSA as placement is coming.
Harry Bhai plss more videos...it's amazing....and more interesting..plss Harry data structures ki playlist ko complete kardo..🙃🙃
Trust me you will get good recognition in your life fir your efforts in youtube for students 👍👍🥺🥺🥺
there is correction in your code @codewithharry at 20:25 inside else statement...
because in that else statement you are just poping the top of stack into postfix Exp when its precedence is greater than infixExpression[i] ..but you also need to push infixExpression[i] after poping the top but you are not doing it..below is the modification i think is needed
if (precedence(infixExpression[i]) > precedence(stackTop(operators)))
{
push(operators, infixExpression[i]);
}
else
{
while(precedence(infixExpression[i])
i had the same doubt glad someone corrected it
He did it correctly because there is a while loop and we are not incrementing i so it will again check the same Infix value with the new top of stack
You really don't need to do that much lol. All you need is an extra else case after precedence check which checks if the stack is empty or not. If the stack is empty, then just push whatever operator is there in the infix. Done.
baap ko mat sikha
same doubt but i know that it is my fault not his
Waiting for this video Bhaiya Thank you ❤️☺️
Children do not understand whether to take computer engineering or artificial intelligence engineering. Which one to take? And if you want to take artificial engineering, is it difficult for them? Please make video on prerequisite for artificial intelligence
You haven't discussed about precedence of power (^) operator in this lecture kindly explain the implementation with that operator too.
Associativity changes in case of that operator.
And brackets also
@@jugalpaul5336 brackets are used to indicate the execution of expression.
if you have brackets in your expression then this code will not work.@@ebaaduddinn8472
jodd explanation love u harry bhai❤✨
you are great harry bhaiya🙇🙇🙇🙇
*Congrats for 600k subscriber 🎉🎉🎉🎉🥳🥳*
@codewithharry congratulations for your 2M ..you deserve it.
Thanks Harry Sir you are the best online teacher
Congrats bhai for 600k followers 🔥🔥🔥🔥
Sir apka ds ka video starting se dekh rha hu dosto me bhi share kiye hai☺️but sir please notes upload kr dijiye please 🙏
That's The I'm waiting for Thanks Harry Sir😊♥️
awesome playlist bookmark this without any delay
I was sooo tense to continue programming as courses at uni buttt these videoss are Amazinggg Sirr, and the you teach every thing is outstanding Allahbless u ,love from pakistan❤
Please add next video fast.. it's difficult to wait😂 in between of an amazing video lectures series 😁
Harry bhai 'how to learn programming by watching videos on TH-cam' py bh koi video bnayen.. Aur yh bh btaain k uski practice Khn sy aur kesy karain..
Thank you sir I understood the concept
Bhaiya bhot mehnati hai hum sote hai or woh lecture upload kar dete hai plz jaldi se subs badao bhaiya ke
Sir this black board is perfect not stressing my eyes and seems to look better
Congratulations 🎉 🎆 for 600K
Subscriber.
Awesome Explanation harry bhai !!
Bro when the next video of this playlist will come???
Please make a video in R programming language with full tutorial 🤓
Congratulations Harry sir 600k subscribe
Congratulations on reaching 601k subs bhai
Goat=harry bhai❤❤
int stackTop(struct stack* sp){
return sp->arr[sp->top];
}
In infix to postfix conversion here it should be char or int in stack top?I am bit confused?
int bro because top ki value toh int me hi store hai na top var me👍👍👍
it should be of char return type. as returned value is a character
char
Harry Bhai ka dialog - "Naam kuch bhi ho function ka, kaam wo sahi se karna chahiye😎 "
Awesome session harry bhai understood clearly💯💕😻🎉
Code op 🔥🔥
But Harry bhai apne stacktop() function int return kr raha h jabki usko char return karna chahiye tabhi to aap uski precedence check kr paayenge
Thanks Harry Bhaiya
Harry bhaiya done with this thank you
bhai awesome!!!! but i have one question...postfix ko prefix me ,prefix ko postfix me....postfix ko infix me ,prefix ko infix me convert krne nahi bolenge kya kabhi....aur infix ko prefix me convert kaise krna hai stack se ye nahi cover kiya aapne....kuch karne vale ho kya ?
Sir please use one note notebook for theory. And thanks for all your hard work.
When I see those kids coding on white hat Jr with Rs. 700/ class I feel like laughing. They are all wasting thier money when there are 100x better classes with more details on code with Harry. 😆😆
unhe lagta hai paisa jada pay krne pr jada knowledge milta hai lol
@@Ashish123 exactly bro. Sahi kaha👍
true mere frd ne udemy pr paisa barbad kiya aur ab yeha padh rha
kam se kam emplyment toh mil ri hai logo ko .......agar koi pay kr r hai to prob kya ....tum logo ko har cheez free mai chahiye hoti hai
@@rishabhinc2936 baat toh sahi hai dekho jo pay karke dekhega woh uski marzi aur jo youTube se karna chahta hai woh uski marzi hum kaun hote hai kehne wale....bass usse aur hume samajh me aana chahiye lekin ye log nahi samjhenge
Sir solution of exercise 3 in android development you forgot 😭😭😭😭😭😭😭😭😭😭 love you coding god❤️❤️❤️
For infix to prefix you have to reverse the infix expression then do its infix to postfix conversion then again reverse the result you'll get the prefix expression
Oh, thanks buddy👍👍
this playlist is really great
Wow dark mode is cool 😍😍
Sir congrats on 6 lakhs
This is good
thank you so much harry bhaiya
harry is the best
Thank you Harry Bhai.✨💫
great vedio
Why is there a need of instance of stack in this program at 25:40 whereas in the previous code (parenthesis matching) stack instance was not required ??
You are superb bro🔥🔥🔥🔥🎉
Thanks sir we want dsa videos fast
GM Harry bhaei please flutter or dart pay vedio bna do Hindi k sare vedios TH-cam k samj nhi ate buss Aap k vedios ascche say smaj ate heai
Or Maine aapke c python or Ab Java k vedios dekhi hu
Please sir flutter pay vedio bna do Hindi may
NEXT VIDEO PLEASE
PLEASE MAKE 2-3 OF DSA A DAY
PLEASE
halwa hai kya
Congratulations @codewithharry for 600k subscribers
You are a hard working legend
Harry Bhai thanks for this wonderful video. I'm stuck in how to put condition for braces please suggest something or reply a code snippet for my query.
Thanks
I want to ask that pls make a playlist on docker
*stackTop should return char type, isn't it?*
int stackTop(struct stack* sp)
{
return sp->arr[sp->top];
}
yeah
but here it will return ascii value which will be converted to character later so everything works fine :)
its freaking returning the array which is alredy been declared as the char ...
Harry bhaiv👋👋
At 20:13 in line 81 you made a mistake, you have used 'else' and in it you have popped from stack if precedence of stack top is greater, but after that you will also have to push the infix expression's operator into the stack. That's what you explained in your last video that if the stack top's precedence is greater or equal to infix operator then we will have to pop the operator until stack top is lower than infix operator and then push the infix operator into the stack. Look into it and correct it please.
i think it works fine and its because we didn't increment i so that character is going to be checked again and this time it will be pushed.
maybe i am wrong. plz do correct me if thats the case
@@little_riddler else if(s.at(i) == '+' || s.at(i) == '-'){
if((str[top] == '+' || str[top] == '-' || str[top] == '*' || str[top] == '/') && (top != -1)){
while(top != -1){
p[j] = pop();
j++;
}
push(s[i]);
}
else {
push(s[i]);
}
}
Here I didnt used the precidence but i created it in my way I hope it will be useful to you
Harry bro pls make videos on MySQL🙏🙏🙏🙏🙏🙏
Learn made easy &smart tq sir👍👍
Sir i request you to teach Bootstrap beginner to advance level please 🙏🙏🙏
Thanx ❣️
harry bhai python projects ki livestream kar do. humko maja aa jayega. aap bahut accha sikhate ho. pls sir. aur django mei bhi aur projecs karvao
Thanks again harry bhai
Awesome as usual❤️
great respect to u sir