Python✅✅ | Simplest approach🚀🚀 
Code


# Code
```python3 []
class Solution:
    def maximumCandies(self, candies: List[int], k: int) -> int:
        n = len(candies)

        def check(mid):
            cnt = sum(candy // mid for candy in candies)
            return cnt >= k

        l, h = 1, sum(candies)
        ans = 0
        while l <= h:
            mid = (l + h) // 2
            if check(mid):
                ans = mid
                l = mid + 1
            else:
                h = mid - 1
        return ans

```
['Array', 'Binary Search', 'Python3']