STACK APPLICATION : BALANCING SYMBOLS - DATA STRUCTURES

[@deepikarani6789]

Sir meru maku oka varam...thank u soo much....thank u..keep going ...u will be world famous soon....our all blessings will be there. 🙏🙏🙏🙏🙏

[@kushelram1857]

could please explain the full code as an example to each topic..that would be wonderful ,,thank u sir

[@bramueee634]

Very nice way of explanation, if possible use different colour markers for variations, thank you

[@Comedy_Buzz_Telugu]

Sir we are understanding clearly Sir. but explain in Telugu alsoo sir

[@Ravikanttiwari088]

Very nice explanation sir

[@xaviball2911]

Helpful video

[@vishwanathhosmane3834]

Sir, please also upload video on 4th application of stack i.e., conversion from infix to prefix expression.

[@hariharans3891]

Just reverse the infix eq and solve it like postfix.... Then reverse the answer obtained

[@ajayjangam007]

Nice explanation sir😊😊😊

[@manumanasa3591]

Sir explain the processing of d function calling n reversing a string

[@AmitSingh-ro2wr]

Good explanation

[@vaishalisawant2689]

Sir if stack is empty ok then expression is balanced and if in case we have one more close bracket in the expression what will be a output expression unmatch

[@subburoxa2980]

helpful video

[@afiez1000]

ty sir....ur video so good...keep it up

[@saikiranstranger9215]

Sir write a code for balenced Symbols...?

[@nigelmendonca1150]

Thank you!

[@Comedy_Buzz_Telugu]

Then we can understand some more better