Task Scheduler | Leet code 621 | Theory explained + Python code | July Leet code challenge

[@uthrakaruna999]

Finally an understandable solution without any complex data structures

[@neilranada]

This is one of the best explanations I've seen. Thank you!

[@AlejandroRuiz-pd6ci]

Incredible explanation. Had no idea how to do this, and you made the problem look like a joke

[@ameynaik2743]

Bucket sort can be used too. hmap = Counter(tasks) maxsize = max(hmap.values()) + 1 bucket = [[] for i in range(maxsize)] for k,v in hmap.items(): bucket[v].append(k) for i in range(maxsize-1,-1,-1): if bucket[i]: maxcnt = len(bucket[i]) maxbuc = i break duration = (maxbuc - 1)*(n+1) + maxcnt return max(duration, len(tasks))

[@LokeshPandey-m1m]

dude this soln is insane

[@wahidsakib]

Very nice and descriptive explanation to this problem I've found

[@soumyadipbasak6380]

superb explanation

[@mallasatyanarayana1942]

For too complex problem, very clear explanation

[@alexandersmirnov4274]

the best explanation Im understand!!!

[@yashsrivastava677]

Please provide solutions for 706. Design HashMap 705. Design HashSet

[@mihiranvikram6445]

very nicely explained.

[@CodingAhead]

great

[@abigailmchugh9452]

Great explanation - but why does the formula sometimes give a smaller value?

[@abigailmchugh9452]

I don't feel like there was a great explanation of the limits of your formula.

[@ishayadav5221]

GREAT EXPLANATION

[@saivishnuadabala2447]

Love you 💕

[@alekseirutkovskii2570]

What are other cases for which the max() in return statement accounts for besides the case when n = 0?

[@edwardteach2]

U a God

[@js__talks]

Will this work for AAABBCCDDEE