1:14:39 don't worry if you are not able to understand in first time , i have watched the lecture twice now i am able to understand how the things are working !!!
1:28:48 logic jo phle number hoga wo infix ka left side se chalu hoga (v1) agar niche wale ko v2 ki jgh v1 bana denge to ordering kharab ho jayegi or jo evaluate kar rhe hai wo glt ho jayega prefix mai loop ulta isliye chal rha kyo ki prefix mai jo operators hote hai wo hamesha left side me hote hai OP_V1V2 agar ulta loop chalyenge to number phle dal payenge or evauluation ho jayegi agar agey se karenge to operators a jaeyga par unke corresponding numbers ni milenge or glt evaluate ho jayega but piche se karenge to to shi hoga jaise hi number ke bad operator ayega wo usi number ke corresponding hoga to evaluation mai gadbad nhi hogi hope this clear the doubts !!!
is me concept essa hota hai 1) infix- infix to total number sum infix to prefix conversion infix to postfix conversion 2)prefix - prefix to total number sum prefix to postfix conversion prefix to infix conversion 3)postfix - postfix to total number sum postfix to prefix conversion postfix to infix conversion ye sab karn a hogha ?
Bro your request is totally insane 🤣😂 who tf would do DSA in php just learn DSA in whichever language you want and make so projects based on php that's it y tf you need php for algorithms 🤣
I think the code is wrong or it need more adjustment of prefix as we have to first the operand like * or / Directly just solve question 3+6+8*4+7 and dry run it you understand what i want to tell? The ans must be +++36*847 but ans coming is ++36+*847
indeed! this approach will not work in some cases where negative sign followed is "*" or "/". eg:- 5+2-2*2+2. eg:- 1*2-3/4+5*6-7*8+9/10 (this one is test case form leetcode question 227 basic calculator.)
Sir ne khud bataya tha...jo topics sir ne padhaya hai...us topic se related jitne bhi topic hai wo raghav sir hi padhayenge..Aur Manvi mam fresh topic se padhayengi like backtracking, tree, graph etc....Aur abhi confirm hai hi Queue, priority queue or heap Raghav sir hi padhayenge...
So vast content no one can do this hardwork only on one topic great salute 🙋
Wow! Hands down itna efforts for free content.
Thank you bhai, much appreciated.
Exactly! Hum khud teacher banenge tabhi teacher's ke efforts samjh me ayenge,please appreciate for all faculties. Thank you.
Maza aa gaya
Easy and west raghav sir is the best all time
Its an awesome class ever found on stack data structures...thanks a lot raghav sir for such useful contents
This content for free!!glad to see education must be free
1:14:39
don't worry if you are not able to understand in first time , i have watched the lecture twice now i am able to understand how the things are working !!!
Sir, lecture dekh kar "maza aa gaya"...
Very very Helpful lecture...
Thank You Sir ❤
What a great serious of dsa I have never seen , thank you sir
Awesome 😎😎😎 kya mst teaching skill hai sir..🙏 great teacher/coder
Thank you Etna dharya se pdhane ke liye❤❤
1:38:36
home work question : )
String str = "953+4*6/-";
Stack stack = new Stack();
for(int i=0; i=48 && ascii
Thankyou Sir💙
For providing new One💙💙
Learning lots of new things
Maza aa gaya 🔥
Thankyou so much sir
😊😊
1:40:35 we can use an inbuilt string function StringValueOf() to typecast it into string
obusly we can but rather than using inbuilt methods its better to use that concept.
1:28:48 logic
jo phle number hoga wo infix ka left side se chalu hoga (v1) agar niche wale ko v2 ki jgh v1 bana denge to ordering kharab ho jayegi
or jo evaluate kar rhe hai wo glt ho jayega
prefix mai loop ulta isliye chal rha kyo ki prefix mai jo operators hote hai wo hamesha left side me hote hai OP_V1V2
agar ulta loop chalyenge to number phle dal payenge or evauluation ho jayegi agar agey se karenge to operators a jaeyga par unke corresponding numbers ni milenge or glt evaluate ho jayega
but piche se karenge to to shi hoga jaise hi number ke bad operator ayega wo usi number ke corresponding hoga to evaluation mai gadbad nhi hogi
hope this clear the doubts !!!
this course have more content as compare to others channels because i have already explore more
best explanation .
thanks a lot sir...mazaa aa gya❤❤❤❤❤
Mazza aa gya sir
Dhasu lecture hai sir aapke majja aa gaya
is me concept essa hota hai
1) infix-
infix to total number sum
infix to prefix conversion
infix to postfix conversion
2)prefix -
prefix to total number sum
prefix to postfix conversion
prefix to infix conversion
3)postfix -
postfix to total number sum
postfix to prefix conversion
postfix to infix conversion
ye sab karn a hogha ?
thanks!
mja nhi sir , bohot jada maja aaya .....❤❤🙌🙌
Maja aagya sir thankyou
1:50:49
homework : )
String str = "-9/*+5346";
Stack stack = new Stack();
for(int i=str.length()-1; i>=0; i--){
char character = str.charAt(i);
int ascii = (int)character;
if(ascii>=48 && ascii
konse year m hai bhai @allplayz256
THANK YOU!!!!!!!!!!!!!!!!!!!!!!
Thank you sir ❤
MAZA aayaagya sir
sir koii dedicated c++ ka course launch karoo jo basic se advance tak competitive level ka
maza aa gaya sir...
Sir tell sankeet sir to make long videos as like you
salute to u....
Sir graph and tree start kriye
Hello Sir, I do have a request.
Can you start a playlist of "PHP with DSA course" on this channel?
It will be helpful for many people.
Bro your request is totally insane 🤣😂 who tf would do DSA in php just learn DSA in whichever language you want and make so projects based on php that's it y tf you need php for algorithms 🤣
😂@@rakshithml4631
maza aa gaya sir
Ma3a aa gaya
maaza aa gaya
great video
Plz add time stamp in decode batch
Mja aa gya sir
Mazaa aagaya
sir please increase the frequency of video placement is near
maza agaya
Mazaaaaa AAAAAAA Gayyaaaaaaaa
Maza Agya Sirji
maza aaaa gayaaaa siirrrr
Maza aa gaya
Sir AAP tree kbhi pdhaoge?
Sir please trees bhi daldo
Maza aagya
Mza agya
can anyone tell me its the best course for dsa ? like best from others or not ?
Maja ah gaya sir
sir collection framework ka video kb ayega????
sir course playlist yane websiteplaylist mai add nahi kiye ho....pliz add
I think the code is wrong or it need more adjustment of prefix as we have to first the operand like * or /
Directly just solve question 3+6+8*4+7 and dry run it you understand what i want to tell?
The ans must be +++36*847 but ans coming is ++36+*847
Yeah bro🤛
can anyone upload the code
of all the program discussed in this lecture.
Data structure with c ka video Kab aayega ?
Maja agaya
Sir the the first expression evaluation failing the test case 5-2*7+8.
indeed!
this approach will not work in some cases where negative sign followed is "*" or "/".
eg:- 5+2-2*2+2.
eg:- 1*2-3/4+5*6-7*8+9/10 (this one is test case form leetcode question 227 basic calculator.)
solution using only one stack:-
Stack st= new Stack();
int i=0;
char operator='+';
int num=0;
while(i
Manvi Mam ka video lectures kyu nhi aa rha hai plz 🙏
Request hai ki Mam lectures attend Karen 🙏🙏🙏🙏
Raghav sir itna acha padhate hai to kyu mam chahiye
@@Usernamepreeti exactly... mereko smjhme nhi aa rha esa q hai... sir ji I guess or accha padha rhe hai
Sir ne khud bataya tha...jo topics sir ne padhaya hai...us topic se related jitne bhi topic hai wo raghav sir hi padhayenge..Aur Manvi mam fresh topic se padhayengi like backtracking, tree, graph etc....Aur abhi confirm hai hi Queue, priority queue or heap Raghav sir hi padhayenge...
maza a gya
maja aa gaya
Sir ye infix to post and infix to pre me all examples ke sath nahi Correct ans de raha hai😢😢😢
maja agaya
👍👍👍
46:21
❤
Coding le liye kon sa batter hai
N6000 ya ryzen 3
Please reply
ryzen 3 is better i use it it is vey fast
Opp
Thank You Sir 🤟
mzza aa gya.
maza aa gya sir
maza aa gaya🔥🔥
maza aa gaya
maza aa gya
Maza aagaya
mazaa aagayaaa
maza a gaya
Maza agaya
Maza aa gaya
Maza Aa gaya
maza aa gya
Maza aagayyaa