efficient algorithm for finding median of an stream of number in constant time complexity

[bravo1goingdark]

Describe your change:

added a medianfinder algorithm with constant time complexity i.e O(1) using max and min heap

• [X] Add an algorithm?
• [ ] Fix a bug or typo in an existing algorithm?
• [ ] Documentation change?

Checklist:

• [X] I have read CONTRIBUTING.md.
• [X] This pull request is all my own work -- I have not plagiarized.
• [X] I know that pull requests will not be merged if they fail the automated tests.
• [X] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [X] All new Python files are placed inside an existing directory.
• [X] All filenames are in all lowercase characters with no spaces or dashes.
• [X] All functions and variable names follow Python naming conventions.
• [X] All function parameters and return values are annotated with Python type hints.
• [X] All functions have doctests that pass the automated testing.
• [X] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• [X] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

[cclauss]

The visibility that dataclasses provides shows off a few things:

• max_heap holds smaller numbers while min_heap holds larger numbers!
• The values in max_heap are negative!