Codility Golden Award for The OLX Group Challenge
This is one of Algorithm Challenges I took. This one is from Codility : The OLX Group Challenge. I managed to find the solution in O(N Log N) complexity. So it's quite scalable. And it was quite fun actually.
Here's the link to the Challenge :
https://app.codility.com/programmers/challenges/olx_group2020/
Brief Description of the problem :
There are N glasses of different capacities, each of them containing a different amount of a unique kind of juice. Calculate the maximum number of kinds of juice that can be mixed in a single glass.