feat: init task scheduler

Author: bujosa

alternative/medium/task_scheduler.py

@@ -37,6 +37,7 @@ pub mod search_a_2d_matrix;
 pub mod search_in_rotated_sorted_array;
 pub mod subsets;
 pub mod subsets_ii;
+pub mod task_scheduler;
 pub mod three_sum;
 pub mod three_sum_closest;
 pub mod time_based_key_value_store;

src/medium/mod.rs

@@ -68,6 +68,7 @@ A priority queue can be implemented using a heap.
 - [x] [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Medium | [Solution](../../../src/medium/k_closest_points_to_origin.rs) | [Problem Description](../../../src/medium/readme.md#973-k-closest-points-to-origin)
 - [x] [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](../../../src/medium/kth_largest_element_in_an_array.rs) | [Problem Description](../../../src/medium/readme.md#215-kth-largest-element-in-an-array)
 - [ ] [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | Medium | [Solution](../../../src/medium/task_scheduler.rs) | [Problem Description](../../../src/medium/readme.md#621-task-scheduler)
+- [ ] [Design Twitter](https://leetcode.com/problems/design-twitter/) | Medium | [Solution](../../../src/medium/design_twitter.rs) | [Problem Description](../../../src/medium/readme.md#355-design-twitter)
 - [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [Solution](../../../src/hard/find_median_from_data_stream.rs) | [Problem Description](../../../src/hard/readme.md#295-find-median-from-data-stream)
 
 Category: `Heap / Priority Queue`