2 and 3 go to different tills. Read the description again.

why
queue_time([2,3,10], 2)

should return 12

first checkout working 2 + 3 == 5 times
and
second checkout working 10 times
10 biggest than 5 and should give 10. but correct answer is 12 :/

Very interesting Kata! Thanks to author!!!

Very nice kata to solve!

as far as i'm concerned, i dont care about how clean the top solutions are. what's important is that i was able to solve the prob, and it has the same time complexity as the top solutions... don't care about anything else. I think you should just enjoy the fact that you were able to solve the problem with good time complexity. as for ur other comment, i don't think it's that impressive, and nope i ain't got experience already.ido think anybody can do it, just focus and take challenges as an opportunity to learn... thts my strategy

Btw you are 6 kyu by just solving 55 kata, which is rare and impressive.
Did you already have experience before you started codewars which helped you solve higher kata(more score point) earlier and rank up quickly.

Or were you beginner and yet you just went ahead and solved higher level kata.

i don’t think it’s a spoiler, but as soon as you imagine the scenario, the solution will be very clear...anywy go get em

Immediately came to the discussion after understanding that it's a good kata. I wonder how long i will take.

just solved it. took me 5 hours!

You're wrong, you're not following all the rules from this kata.

U solved a 2KYU prob and came to this prob to show how smart u r, and ended up getting humbled! It should be a 5KYU tho, imo.

no, becasue the 2 in the queue is finished and replaced by 10 before the 3 is done

I tried to test the testFn from the "Test Cases". But the function is not working properly!

GOOD:

customers {100, 50, 90, 90, 60}

n 2

return 200

ERROR:

customers {100, 90, 90, 60, 50}

n 2

return 210

log:

100 0

100 90

100 180

160 180

210 180

but true way 100 + 90 =190 vs 90 + 60 + 50 = 200

true algorithm see (for n == 2):
https://www.geeksforgeeks.org/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum/