3100. Water Bottles II | Simulation | Array | Weekly Contest 391

[@swarnavopramanik1701]

Bhaiya like leetcode contest can you start please codeforce round intuition Vedio, I am totally new in CP and can't do this question number 2 to till last in CF div 1 + div 2 round ....

[@theultimatespo...4205]

Even after 4 to 5 submission I am not able to got the case of emptybottle++ in contest finally now I got what I am missing that time 😊 thank bhaiya keep it up

[@arijitsingh1096]

This was very easy question but i took a lot of time.. can you pls tell me how to improve speed of doing such questions...

[@niteshsaxena1066]

This is the first medium problem which I was able to solve on my own in a leetcode weekly

[@k.8597]

I feel so stupid not being able to simulate this mai recursion karra tha base case hi sahi se nahi set ho para tha

[@Ayush37262]

Bro is in Super Saiyan mode 💀

[@TusharRaja3009]

why is it giving run time error please tell class Solution { public: int maxBottlesDrunk(int numBottles, int numExchange) { int n=numBottles; vector arr(2*n); for(int i=0;i

[@harshitha4886]

I solved this q after 4 submissions . I couldn't understand the logic. I solved next question also then I came back