C++ Solution 100% Faster 💫💫💫
"""\n#define ll long long\nclass Solution {\npublic:\n    int maximumCandies(vector& candies, long long k) {\n        ll left=1,right=*max_element(candies.begin
"""\n#define ll long long\nclass Solution {\npublic:\n    int maximumCandies(vector<int>& candies, long long k) {\n        ll left=1,right=*max_element(candies.begin(),candies.end());\n        ll size=candies.size();\n        ll maxi=0;\n        while(left<=right){\n            ll mid=left+(right-left)/2;\n            ll temp=0;\n            for(int i=0;i<size;i++){\n                temp+=candies[i]/mid;\n            }\n            if(temp>=k){\n                maxi=mid;\n                left=mid+1;\n            }else{\n                right=mid-1;\n            }\n        }\n        return maxi;\n    }\n};\n"""\n\nPlease Upvote if you find it Helpful \uD83D\uDE42.
['Binary Search', 'C']