วีดีโอ

Super

Good

Good

//code struct da{ int pos; int health; char dir; int idx; }; class Solution { public: vector<int> survivedRobotsHealths(vector<int>& posi, vector<int>& he, string dd) { int n = posi.size(); vector<da>a(n); for(int i=0; i<n ;i++){ a[i].pos = posi[i]; a[i].health = he[i]; a[i].dir = dd[i]; a[i].idx = i; } sort(a.begin() , a.end() ,[&](auto a, auto b){ return a.pos <b.pos; } ); stack<int>st; for(int i=0; i<n ;i++){ if(a[i].dir=='R'){ st.push(i); } else if(a[i].dir=='L'){ while(!st.empty() && a[st.top()].dir=='R' && a[i].health >0){ int x= a[st.top()].health; int y = a[i].health; if(x==y){ a[st.top()].health =0; a[i].health=0; st.pop(); } else if(x>y){ a[st.top()].health-=1; a[i].health =0; } else{ a[st.top()].health=0; a[i].health-=1; st.pop(); } } } } vector<int>res; sort(a.begin() ,a.end() , [&](auto a, auto b){ return a.idx < b.idx ; }); for(int i=0; i<n ;i++){ if(a[i].health >0){ res.push_back(a[i].health); } } return res; } }; although you will be finding better code than this which will only need one time sorting and is available on leetcode editorial

Super Aman, Very good 👍👍👍

//code class Solution { public: int maximumGain(string s, int x, int y) { string s1="ab"; string s2 ="ba"; if(x<y){ swap(s1,s2); swap(x,y); } stack<char>st; int score=0; for(auto ch : s){ if(st.empty()){ st.push(ch); } else{ if( st.top()==s1[0] && ch == s1[1]){ score+=x; st.pop(); } else{ st.push(ch); } } } string temp; while(!st.empty()){ temp.push_back(st.top()); st.pop(); } reverse(temp.begin() , temp.end()); for(auto ch : temp){ if(st.empty()){ st.push(ch); } else{ if(st.top()==s2[0] && ch==s2[1]){ score+=y; st.pop(); } else{ st.push(ch); } } } return score; } };

Bhaiya maine aaj newspaper mai ad dekhi Graphic Hill University ke placement ki to plz aap thoda review de skte ho umne kitni reality h aur cse mai total kitne students h specialisation milake aur kitne place hue avg package ky tha aur highest package on campus tha ya of campus plzz bhaiya tym nikale thoda btana ❤

Promo-SM 😑

Good

👌👌👌👌