Daily JavaScript Challenge: Find the Maximum Consecutive Ones in a Binary Array
Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp!
The Challenge
Difficulty: Medium
Topic: Arrays
Description
Given a binary array (containing only 0s and 1s), find the maximum number of consecutive 1s present in the array.
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/Array
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 (1)
Math.max(...arr.join``.match(/1+|0+/g).map(({0:f,length:l})=>+f?l:0))
Some comments may only be visible to logged-in visitors. Sign in to view all comments.