Create count_1s_brian_kernighan_method

[jainendra]

Ref - http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan
Created as part of Hacktoberfest challenge, please add hacktoberfest-accepted if/when merged

Describe your change:

Used Brian Kernighan's way to calculate the count of 1s in binary representation of a number. This method reduces the iteration count than how 1s are normally counted
Refer -
http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan
and https://www.geeksforgeeks.org/count-set-bits-in-an-integer/

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

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.