Stack Bash - Master data structures and algorithms

Power of Two

Easy
Given a positive integer n, write a function that returns whether n is a power of 2.
For example, if n = 4, your function should return True.
If n = 5, your function should return False

Try it first

Solution

6 Essential Primitives Coding Interview Problems

Master Primitives by trying the coding challenges below.
  1. 1.Swap bitsEasy
  2. 2.Power of twoEasy
  3. 3.Count bitsMedium
  4. 4.Reverse bitsMedium
  5. 5.Find duplicateMedium
  6. 6.Bitwise additionHard

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.