Sanjaykumar-IT/dsa-problems

Check if it is a power of 2

Open

#23 opened on Oct 29, 2024

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Java (4 forks)auto 404
hacktoberfesthactoberfest2024

Repository metrics

Stars
 (1 star)
PR merge metrics
 (PR metrics pending)

Description

Input n = 8 Output true ( 2^3=8)

Input n = 32 Output true (2 ^5=32) Input n = 15 Output false

Contributor guide

Research direction
Implement a function isPowerOfTwo that returns true if n is a power of 2. Use bit manipulation: a power of two has exactly one bit set, so (n & (n 1)) == 0 for n > 0.
Tech stack
java
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
1
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Under 1 hour
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Java basics
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
85