Name:Unknown
Clan:Unknown
Member Since:Mar 2019
Last Seen:Mar 2024
Profiles:
Following:0
Followers:0
Allies:0
Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
This comment is hidden because it contains spoiler information about the solution
Wtf!
Can anyone explain this solution step by step? Seems too strange to me
This comment is hidden because it contains spoiler information about the solution
Well the code is readable, but the computational cost of it is way too big
This comment is hidden because it contains spoiler information about the solution
The idea is to "simulate" all the rows with an easy method: just take the numbers of customers and add to the queue with the lowest value. Then you return the highest value queue.
in detail: first we create another vector of values of fixed size (n) and set the values to 0.
then we iterate all the customers values (int i : customers) where i is getting the value of customers[0],[1]...etc; and we add that value to de lowest value queue.
at the end we got a vector of n values (queues) and we just have to return the max value of them.
why I get -2147483648 when running this for n=0?
I think this is the fastes solution
I think there might be a problem with the tests...