Count no. of set bits in Kotlin

[kiruba-r11]

🚀 Feature

For a given number, we have to count the no. of set bits

Have you read the Contributing Guidelines on Pull Requests?

YES

Motivation

The Kotlin repository is not having enough programs and concepts like other common programming languages like C++, C, Python, or Java. So, I want to contribute to the Kotlin directory as much as possible and make it have enough programs that could help other Kotlin beginners.

Pitch

It uses an algorithm called Kernighan's Algorithm which is famous to solve this problem in O(no. of set bits) time complexity.

[github-actions]

Hello @kiruba-r11,
Thank you for opening an issue. 🥳
To get assigned to this particular issue please use /assign
Check this guide before contributing.

[kiruba-r11]

/assign

[github-actions]

This issue has been assigned to @kiruba-r11!
It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.