CodeChef Starters 169 | Video Solutions - A to C | by Pradyumn Kejriwal | TLE Eliminators

[@TLE_Eliminators]

Please fill the Feedback form for PCD: forms.gle/RfNSg7dgj9XE99d88

[@ayaaniqbal3531]

Great Explanation for the C problem .

[@algo820]

Hi, great explanations, I would also love if you could solve atcoders problems, I feel that they are high quality problems and there is no video explanations in English, so they will be very helpful. ❤️

[@NobodyKnows098]

My solution for B: int t= 1; cin>>t; up: while(t--){ int n, k; cin>>n>>k; vector v(n); map mp; set s; for(int i=0;i>v[i]; mp[v[i]]++; s.insert(v[i]); } int mx = INT_MIN; for(auto e : s){ mx = max(mx, mp[e]); } if(mx == mp[k]){ cout

[@garvi1202]

Get well soon

[@39_jatinjain4]

Can anyone tell Why WA in ques-C vectorpos,neg; bool check(ll &lim){ int i=0,j=0,n=pos.size(),m=neg.size(); ll s=0; vectorb; while(i

[@manoor0858]

bro u just need 31 more points for 6 star ,good luck on ur next contest

[@pradyumnkejriwal3007]

Thanks!

[@infinity-d6d]

a senior from my college has 2254 rating