Skip to content

Added minimum waiting time problem solution using greedy algorithm #8701

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 11 commits into from
May 1, 2023
Merged
Prev Previous commit
Next Next commit
[pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
  • Loading branch information
pre-commit-ci[bot] committed Apr 29, 2023
commit 6520b7b1c0ab9cd1079360c270273c9da47bb84b
2 changes: 1 addition & 1 deletion DIRECTORY.md
Original file line number Diff line number Diff line change
Expand Up @@ -450,7 +450,7 @@
* [Fractional Knapsack 2](greedy_methods/fractional_knapsack_2.py)
* [Optimal Merge Pattern](greedy_methods/optimal_merge_pattern.py)
* [Minimum Waiting Time ](greedy_methods/minimum_waiting_time.py)

## Hashes
* [Adler32](hashes/adler32.py)
* [Chaos Machine](hashes/chaos_machine.py)
Expand Down
3 changes: 2 additions & 1 deletion greedy_methods/minimum_waiting_time.py
Original file line number Diff line number Diff line change
Expand Up @@ -40,6 +40,7 @@ def minimum_waiting_time(queries):
return total_waiting_time


if __name__ == '__main__':
if __name__ == "__main__":
import doctest

doctest.testmod()