Feat : Boyer–Moore majority vote algorithm

[Manan-09]

What would you like to Propose?

Boyer–Moore majority vote algorithm : Wiki

Boyer–Moore majority vote algorithm is used to find majority of element in given collection of items. Majority elements mean , element that occurs more than or equal to N / 2 times in collection with size of N.

Example :
Input : [3,4,1,4,2,4]
Output : 4

Issue details

Implementation of Boyer–Moore majority vote algorithm is missing in current codebase, please point out if it's present.

Additional Information

No response

[Waqiur]

I would like to contribute to this problem. Please assign it to me. Thanks

[its-100rabh]

I would like to contribute to this problem. Thanks

[HimanshuMahto]

Hey, please assign me this issue to work on.

[vil02]

This already exists: BoyerMoore.