Added code for majority element #6689

[jaygala223]

Describe your change:

The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

The solution is based on Moore's Voting Algorithm

• [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 have a URL in its comments that points to Wikipedia or other similar explanation.
• [X] If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.