🔥 Numer of 1 Bits

Author: maddhruv

README.md

@@ -17,3 +17,4 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 | [3Sum](./3sum.js)                                                                 | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Two Pointers`, `Sorting`                 | [:link:](https://leetcode.com/problems/3sum/)                                 |
 | [Container With Most Water](./container-with-most-water.js)                       | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Two Pointers`, `Greedy`                  | [:link:](https://leetcode.com/problems/container-with-most-water/)            |
 | [Sum of Two Integers](./sum-of-two-integers.js)                                   | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Math`, `Bit Manipulation`                         | [:link:](https://leetcode.com/problems/sum-of-two-integers/)                  |
+| [Number of 1 Bits](./number-of-1-bits.js)                                         | <img src="https://img.shields.io/badge/-Easy-green" />    | `Bit Manipulation`                                 | [:link:](https://leetcode.com/problems/number-of-1-bits/)                     |

number-of-1-bits.js

@@ -0,0 +1,10 @@
+const hammingWeight = (n) => {
+  let result = 0;
+
+  while (n) {
+    result += n % 2; // Either 1 or 0
+    n = n >> 1; // Right Shift by 1
+  }
+
+  return result;
+};