Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 578 |

@rdakka | 530 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

Given a number **N **and a bit number **K**, check if **K ^{th}** bit of N is

**Input**: N = 4, K = 0
**Output**: No
**Explanation**: Binary representation of 4 is 100,
in which 0^{th} bit from LSB is not set.
So, return false.

**Example 2:**

**Input**: N = 4, K = 2
**Output**: Yes
**Explanation**: Binary representation of 4 is 100,
in which 2^{nd} bit from LSB is set.
So, return true.

**Example 3:**

**Input**: N = 500, K = 3
**Output**: No
**Explanation**: Binary representation of 500 is
111110100, in which 3rd bit from LSB is not set.
So, return false.

You don't have to read input or print anything. Your task is to complete the **function checkKthbit **that takes **n and k as parameters** and **returns **either **true **(if kth bit is set) or **false**(if kth bit is not set).

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

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

**Constraints:**

1 ≤ N ≤ 10^{9}

0 ≤ K ≤ floor(log_{2}(N) + 1)

1 ≤ N ≤ 10

0 ≤ K ≤ floor(log

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
Check whether K-th bit is set or not

...