#bit_manipulations
Title: Check Power of Two
URL: binarysearch
Level: Easy
! if n is power of 2, in binary numbers it will have only one '1' (e.g 64=> 100000),
if not power of 2, it will have more than one '1's. (e.g 33=>10001)
Title: Check Power of Two
URL: binarysearch
Level: Easy
! if n is power of 2, in binary numbers it will have only one '1' (e.g 64=> 100000),
if not power of 2, it will have more than one '1's. (e.g 33=>10001)
Title: 1404. Number of Steps to Reduce a Number in Binary Representation to One
URL: leetcode
Level: Medium
URL: leetcode
Level: Medium
Title: Least Number of Unique Integers after K Removals
URL: leetcode
Level: Medium
URL: leetcode
Level: Medium