Daily JavaScript Challenge: Binary Gap Length
Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp!
The Challenge
Difficulty: Medium
Topic: Bit Manipulation
Description
Write a function that takes an integer and returns the length of the longest sequence of consecutive zeros ("gaps") that are surrounded by ones in the binary representation of the given number. The function should return 0 if there are no gaps.
Ready to Begin?
- Fork this challenge
- Write your solution
- Test it against the provided test cases
- Share your approach in the comments below!
Want to Learn More?
Check out the documentation about this topic here: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/toString
Join the Discussion!
- How did you approach this problem?
- Did you find any interesting edge cases?
- What was your biggest learning from this challenge?
Let's learn together! Drop your thoughts and questions in the comments below. 👇
This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀
Top comments (3)
What about 0 or negative numbers? There is a maximum value for the input or anything like
21234567890212345678902123456789021234567890212345678902123456789045678902123456789456789034562123021234567890
is admissible?
In today's challenge, write a function to find the length of the longest sequence of consecutive zeros surrounded by ones in the binary representation of a given integer. Return 0 if no gaps exist. Check out the challenge here and share your approach! #javascript #coding
I am wondering how many people do these challenges on the dpcdev.com site. I tend to be on the leader board waaay too easily. Maybe the leader-board does not quite work? Anyway, I encourage everyone to try. The tasks are relatively simple, take 5-10 minutes. A coffee break thing.