Thankyou beta! I am glad you liked it. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
I am glad bro. Aapke kaam aa rhi hain videos. Padhte rahie. Abhi sirf shuru hue hain. 800 videos to DS mei aur bnaenge firr Dev, ML, CORE jo bhi jaante hain sab daalenge.
Instead of String v1 = oprnd.pop(); it should be String v1 = oprnd.isEmpty() ? "" : oprnd.pop(); as it is failing for some test cases. Gr8 explanation btw :-)
Very good explanation sir, 7:45 if we accept only 4 operators +, -, * and / then after first if without else we can directly return 2 sir ? if(ch =='+' ||ch=='-'){ return 1} return 2; is this correct sir?
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
on 20:02 line no. 34 if we don't check for ops.peek() != '(' then also the code will run fine because precedence will always return lower value for '(' and will never go beyond it.
Glad it was helpful! and f you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
@@Pepcoding jalne ka to pta nahi guruji baki apni traf se to 100% effort dalunga, abhi to naukri hai nahi 1 sal ho gya engineering ko, or kuch nahi hua to pitaji ki dukan to hai hi, usi ke liye koi software bna lenge dhang ka sa
sir I'm getting this runtime error Exception in thread "main" java.util.EmptyStackException at java.base/java.util.Stack.peek(Stack.java:102) at java.base/java.util.Stack.pop(Stack.java:84) at Main.main(Main.java:28) The code is exactly like that of yours but it keeps throwing this error
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
Practice makes you perfect, keep working hard. For better experience and curated content sign up on nados.io, you can also post your queries on community tab of NADOS.
GOD Level teaching. Kudos to sir.
Thankyou beta!
I am glad you liked it. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
Sir truly you're God in explanation. Can't be more thankful!!!! 🙏🏻🙏🏻
no one can teach better than u , exactly god level teaching
Sir, you are so hardworking!!!!!!!!!! Just loved the way you try again n again for making things simpler!!!!!!!!!!
Thank You So Much for this wonderful video............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
My Recommendation to everyone, as sir said, please watch the infix evaluation video, before watch this, you will love this video after that,
no body explains this good
🙏
sir sach me aap khatarnak padhate hain kash thode aur pehle mile hote. to kya hi baat hoti :)
I am glad bro. Aapke kaam aa rhi hain videos. Padhte rahie. Abhi sirf shuru hue hain. 800 videos to DS mei aur bnaenge firr Dev, ML, CORE jo bhi jaante hain sab daalenge.
@@Pepcoding thank you sir...
Instead of String v1 = oprnd.pop(); it should be
String v1 = oprnd.isEmpty() ? "" : oprnd.pop();
as it is failing for some test cases.
Gr8 explanation btw :-)
Sir aapne post aur pre naam ka stack banaya hai toh postfix naam ke stack mein push kaise kar rahe hai???
Very good explanation sir, 7:45 if we accept only 4 operators +, -, * and / then after first if without else we can directly return 2 sir ?
if(ch =='+' ||ch=='-'){
return 1}
return 2;
is this correct sir?
Yes its correct but don't write this in the interview because if you will write both conditions it will be more understandable to the interviewer
Great explanation. Very detailed. Keep it up sir.
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Can we use Character.isLetterOrDigit(ch) function in If condition to check alphabet or digits?
yes you can here's the code for your reference.
class infixConversionStackPep {
public static void main(String[] args) {
Scanner sam = new Scanner(System.in);
String str = sam.nextLine();
Stack pre = new Stack();
Stack post = new Stack();
Stack optors = new Stack();
for(int i =0;i0 && optors.peek()!='('){
char op = optors.pop();
String v2pre = pre.pop();
String v1pre = pre.pop();
String valpre = value(v1pre,v2pre,String.valueOf(op),"pre");
pre.push(valpre);
String v2post = post.pop();
String v1post = post.pop();
String valpost = value(v1post,v2post,String.valueOf(op),"post");
post.push(valpost);
}
optors.pop();
}else if(Character.isLetterOrDigit(ch)){
pre.push(String.valueOf(ch));
post.push(String.valueOf(ch));
}else if(ch=='*'||ch=='+'||ch=='-'||ch=='/'){
while (optors.size()>0 && optors.peek()!='(' && precedence(ch)0){
char op = optors.pop();
String v2pre = pre.pop();
String v1pre = pre.pop();
String valpre = value(v1pre,v2pre,String.valueOf(op),"pre");
pre.push(valpre);
String v2post = post.pop();
String v1post = post.pop();
String valpost = value(v1post,v2post,String.valueOf(op),"post");
post.push(valpost);
}
System.out.println(pre.peek());
System.out.println(post.peek());
}
public static int precedence(char optors){
if(optors=='+'){
return 1;
}else if(optors=='-'){
return 1;
}else if(optors=='*'){
return 2;
}else {
return 2;
}
}
public static String value(String v1,String v2,String optor,String fun){
if(fun=="pre"){
return optor+v1+v2;
}else {
return v1+v2+optor;
}
}
}
on 20:02 line no. 34 if we don't check for ops.peek() != '(' then also the code will run fine because precedence will always return lower value for '(' and will never go beyond it.
Uss line ki wajah se kuch error aa rha hai, run hi nahi ho rha. Keeps showing runtime error
Awesome videos
Though it took more time to get but it was best explanation
No issues beta, lge rho aise he aur aage bdte rho😊
Nice exaplanation sir. I daily solve questions from pepcoding resources. Its really helpful
Thanks :) Hope you are also making the use of nados.pepcoding.com
You are azming teaching in world
i didn't applied logic of identifying abcd or number and all, instead i used else ..
Great Intuitive Explanation
Glad it was helpful! and f you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Guruji 200 din wali sprint start kar rha hu aaj se dekhte hai agle 1 sal me kya hota hai.
bhai bhot mushkil hogi. jalna hoga. firr aisa hai ki jalne mei jo mza hai, wo parvane jaante hai! eeshwar aapko aur humei sahi rakhe.
@@Pepcoding jalne ka to pta nahi guruji baki apni traf se to 100% effort dalunga, abhi to naukri hai nahi 1 sal ho gya engineering ko, or kuch nahi hua to pitaji ki dukan to hai hi, usi ke liye koi software bna lenge dhang ka sa
ka progress ha bro ?
Haan bhai progress and results batao
@@boredpotato6366 Lag gayi bro naukri 200 din se phle hi
Sir es code me () use kerne pe stack empty error as rha hai normal 2+3 se eroor nhi aa rhahai
() ka kuch matlab nahi hua na. invalid / empty expression hai.
sir I'm getting this runtime error Exception in thread "main" java.util.EmptyStackException
at java.base/java.util.Stack.peek(Stack.java:102)
at java.base/java.util.Stack.pop(Stack.java:84)
at Main.main(Main.java:28)
The code is exactly like that of yours but it keeps throwing this error
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
class infixConversionStackPep {
public static void main(String[] args) {
Scanner sam = new Scanner(System.in);
String str = sam.nextLine();
Stack pre = new Stack();
Stack post = new Stack();
Stack optors = new Stack();
for(int i =0;i0 && optors.peek()!='('){
char op = optors.pop();
String v2pre = pre.pop();
String v1pre = pre.pop();
String valpre = value(v1pre,v2pre,String.valueOf(op),"pre");
pre.push(valpre);
String v2post = post.pop();
String v1post = post.pop();
String valpost = value(v1post,v2post,String.valueOf(op),"post");
post.push(valpost);
}
optors.pop();
}else if(Character.isLetterOrDigit(ch)){
pre.push(String.valueOf(ch));
post.push(String.valueOf(ch));
}else if(ch=='*'||ch=='+'||ch=='-'||ch=='/'){
while (optors.size()>0 && optors.peek()!='(' && precedence(ch)0){
char op = optors.pop();
String v2pre = pre.pop();
String v1pre = pre.pop();
String valpre = value(v1pre,v2pre,String.valueOf(op),"pre");
pre.push(valpre);
String v2post = post.pop();
String v1post = post.pop();
String valpost = value(v1post,v2post,String.valueOf(op),"post");
post.push(valpost);
}
System.out.println(pre.peek());
System.out.println(post.peek());
}
public static int precedence(char optors){
if(optors=='+'){
return 1;
}else if(optors=='-'){
return 1;
}else if(optors=='*'){
return 2;
}else {
return 2;
}
}
public static String value(String v1,String v2,String optor,String fun){
if(fun=="pre"){
return optor+v1+v2;
}else {
return v1+v2+optor;
}
}
}
take a look it might help,and dont forget to pop the opening barces at line number 29
sir isko tree wale tareeke se bhi krke dikha do
It took me 2hrs to code by myself 😐😐
Practice makes you perfect, keep working hard. For better experience and curated content sign up on nados.io, you can also post your queries on community tab of NADOS.