Guys, Are you liking the DSA For Placement series ? Codechef is the place to hone your coding & programming skills. Click here bit.ly/2Wbt6Dw to register yourself on Codechef for the coding practice problem & CodeChef Monthly Programming Contests - Long Challenges, Cook-Offs, Lunchtimes & Starters.
Main to sir apka kasam se fan ho gya amazing way of explanation I've never ever seen like you express in this series not only this but also everywhere thanks a lot sir🙏❤️🙏
in the problem given a string of '(' and ')', print the minimum number of swaps required to make the whole string Correct Bracket Sequence.. Let n = size of seived stack, then answer = ceil(n/4).
Guys, Are you liking the DSA For Placement series ?
Codechef is the place to hone your coding & programming skills.
Click here bit.ly/2Wbt6Dw to register yourself on Codechef for the coding practice problem & CodeChef Monthly Programming Contests - Long Challenges, Cook-Offs, Lunchtimes & Starters.
Main to sir apka kasam se fan ho gya amazing way of explanation I've never ever seen like you express in this series not only this but also everywhere thanks a lot sir🙏❤️🙏
Thanks and welcome, keep watching & keep supporting us👍
monitonic stack 1:31:56
in the problem given a string of '(' and ')', print the minimum number of swaps required to make the whole string Correct Bracket Sequence.. Let n = size of seived stack, then answer = ceil(n/4).
😍😍grt series, loving it❤
good explanation of monotone stacks
It's really helpful series 🔥
Thanks a lot🙏, keep keep watching and keep sharing👍
Aj jake min stack kabhi nahi bhoolunga
Great, keep watching and do subscribe.
18:22 sir giving death stare!
Couldn't understand the last two question's solution ☹️
Stl playlist?
You can checkout the entire DSA For Placements | Basics To Ace It | Playlist link - bit.ly/3kflAjf
Balanced parenthesis
public boolean isValid(String s) {
if((s.length()&1)==1) return false;
Stack st = new Stack();
for(int i=0;i
You would get more reviews if you speak in English, also you could add subtitles too