Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 5765 |

@blackshadows | 5715 |

@akhayrutdinov | 5111 |

@mb1973 | 4993 |

@Quandray | 4944 |

@saiujwal13083 | 4506 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3516 |

@sushant_a | 3459 |

@verma_ji | 3341 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@aroranayan999 | 1276 |

@bt8816103042 | 739 |

@rohitanand | 495 |

@codeantik | 479 |

@shalinibhataniya1097 | 472 |

@amrutakashikar2 | 464 |

@thealchemist627 | 456 |

@shivanandp12345678910 | 453 |

@dalwainazism125 | 453 |

@akashkale117 | 453 |

@SherlockHolmes3 | 447 |

Complete Leaderboard |

Given an integer an **N.** The task is to return the position of **first set bit found from the right side** in the binary representation of the number.

**Note**: If there is no set bit in the integer N, then return 0 from the function.

**Example 1:**

**Input**: N = 18
**Output**: 2
**Explanation**: Binary representation of
18 is 010010,the first set bit from the
right side is at position 2.

**Example 2:**

**Input**: N = 12
**Output**: 3
**Explanation**: Binary representation
of 12 is 1100, the first set bit
from the right side is at position 3.

**Your Task:**

The task is to complete the function **getFirstSetBit**() that takes an integer **n** as a **parameter **and **returns **the** position of first set bit**.

**Expected Time Complexity:** O(log N).

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

**Constraints:**

0 <= N <= 10^{6}

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
Find first set bit

...