reduce time complexity from O(nlogn) to O(n) - Githubissues

NITIN23329 / LeetCode

This repo contains several problems solved at leetcode

MIT License

1 stars 0 forks source link

reduce time complexity from O(nlogn) to O(n) #13

Open NITIN23329 opened 3 years ago

NITIN23329 commented 3 years ago

topic : queue/greedy O(nlogn) solution : https://github.com/NITIN23329/LeetCode/blob/e200e2f776d6f69a610a43c60e8eb858fee335fd/Queue/TaskScheduler.java#L1 question : https://leetcode.com/problems/task-scheduler/