Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@esmadhan | 90 |

@senthil1185 | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Given a positive integer N, print count of set bits in it.

**Example 1:**

Input:N = 6Output:2Explanation:Binary representation is '110' So the count of the set bit is 2.

**Example 2:**

Input:8Output:1Explanation:Binary representation is '1000' So the count of the set bit is 1.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **setBits**() which takes an Integer N and returns the count of number of set bits.

**Expected Time Complexity:** O(LogN)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 ≤ N ≤ 10^{9}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Set Bits

...