Skip to content

added largest_power_of_2 #9463

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions bit_manipulation/largest_power_of_2
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
def largest_power_of_2(number: int) -> int:
"""
returns the largest power of 2 that is less than or equal to the given number
The way this works is that we shift the binary form of the number to the right until we reach the last set bit
Using the number of times we had to shift to find the last set bit, we find the 2**(no of times shifted) which will be the ans
"""

last_set_bit = 0
while number:
last_set_bit+=1
number>>=1
return 2**(last_set_bit-1)


if __name__ == "__main__":
import doctest

doctest.testmod()