# Maximum number of consecutive 1’s in binary representation of all the array elements

Given an array **arr[]** of **N** elements, the task is to find the maximum number of consecutive **1’s** in the binary representation of an element among all the elements of the given array.

**Examples:**

Input:arr[] = {1, 2, 3, 4}

Output:2

Binary(1) = 01

Binary(2) = 10

Binary(3) = 11

Binary(4) = 100

Input:arr[] = {10, 15, 37, 89}

Output:4

**Approach:** An approach to find the count of maximum consecutive 1s in the binary representation of a number has been discussed in this article. The same approach can be used to find the same for all the elements of the given array and the maximum among those values is the required answer.

Below is the implementation of the above approach:

## C++

`// C++ implementation of the approach ` `#include <iostream> ` `using` `namespace` `std; ` ` ` `// Function to return the count of ` `// maximum consecutive 1s in the ` `// binary represntation of x ` `int` `maxConsecutiveOnes(` `int` `x) ` `{ ` ` ` `// Initialize result ` ` ` `int` `count = 0; ` ` ` ` ` `// Count the number of iterations to ` ` ` `// reach x = 0. ` ` ` `while` `(x != 0) { ` ` ` `// This operation reduces length ` ` ` `// of every sequence of 1s by one ` ` ` `x = (x & (x << 1)); ` ` ` ` ` `count++; ` ` ` `} ` ` ` ` ` `return` `count; ` `} ` ` ` `// Function to return the count of ` `// maximum consecutive 1s in the ` `// binary represntation among all ` `// the elements of arr[] ` `int` `maxOnes(` `int` `arr[], ` `int` `n) ` `{ ` ` ` `// To store the answer ` ` ` `int` `ans = 0; ` ` ` ` ` `// For every element of the array ` ` ` `for` `(` `int` `i = 0; i < n; i++) { ` ` ` ` ` `// Count of maximum consecutive 1s in ` ` ` `// the binary representation of ` ` ` `// the current element ` ` ` `int` `currMax = maxConsecutiveOnes(arr[i]); ` ` ` ` ` `// Update the maximum count so far ` ` ` `ans = max(ans, currMax); ` ` ` `} ` ` ` ` ` `return` `ans; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `arr[] = { 1, 2, 3, 4 }; ` ` ` `int` `n = ` `sizeof` `(arr) / ` `sizeof` `(` `int` `); ` ` ` ` ` `cout << maxOnes(arr, n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java implementation of the approach ` `class` `GFG ` `{ ` ` ` `// Function to return the count of ` `// maximum consecutive 1s in the ` `// binary represntation of x ` `static` `int` `maxConsecutiveOnes(` `int` `x) ` `{ ` ` ` `// Initialize result ` ` ` `int` `count = ` `0` `; ` ` ` ` ` `// Count the number of iterations to ` ` ` `// reach x = 0. ` ` ` `while` `(x != ` `0` `) ` ` ` `{ ` ` ` `// This operation reduces length ` ` ` `// of every sequence of 1s by one ` ` ` `x = (x & (x << ` `1` `)); ` ` ` ` ` `count++; ` ` ` `} ` ` ` `return` `count; ` `} ` ` ` `// Function to return the count of ` `// maximum consecutive 1s in the ` `// binary represntation among all ` `// the elements of arr[] ` `static` `int` `maxOnes(` `int` `arr[], ` `int` `n) ` `{ ` ` ` `// To store the answer ` ` ` `int` `ans = ` `0` `; ` ` ` ` ` `// For every element of the array ` ` ` `for` `(` `int` `i = ` `0` `; i < n; i++) ` ` ` `{ ` ` ` ` ` `// Count of maximum consecutive 1s in ` ` ` `// the binary representation of ` ` ` `// the current element ` ` ` `int` `currMax = maxConsecutiveOnes(arr[i]); ` ` ` ` ` `// Update the maximum count so far ` ` ` `ans = Math.max(ans, currMax); ` ` ` `} ` ` ` `return` `ans; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String []args) ` `{ ` ` ` `int` `arr[] = { ` `1` `, ` `2` `, ` `3` `, ` `4` `}; ` ` ` `int` `n = arr.length; ` ` ` ` ` `System.out.println(maxOnes(arr, n)); ` `} ` `} ` ` ` `// This code is contributed by 29AjayKumar ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation of the approach ` ` ` `# Function to return the count of ` `# maximum consecutive 1s in the ` `# binary represntation of x ` `def` `maxConsecutiveOnes(x) : ` ` ` ` ` `# Initialize result ` ` ` `count ` `=` `0` `; ` ` ` ` ` `# Count the number of iterations to ` ` ` `# reach x = 0. ` ` ` `while` `(x !` `=` `0` `) : ` ` ` ` ` `# This operation reduces length ` ` ` `# of every sequence of 1s by one ` ` ` `x ` `=` `(x & (x << ` `1` `)); ` ` ` ` ` `count ` `+` `=` `1` `; ` ` ` ` ` `return` `count; ` ` ` `# Function to return the count of ` `# maximum consecutive 1s in the ` `# binary represntation among all ` `# the elements of arr[] ` `def` `maxOnes(arr, n) : ` ` ` ` ` `# To store the answer ` ` ` `ans ` `=` `0` `; ` ` ` ` ` `# For every element of the array ` ` ` `for` `i ` `in` `range` `(n) : ` ` ` ` ` `# Count of maximum consecutive 1s in ` ` ` `# the binary representation of ` ` ` `# the current element ` ` ` `currMax ` `=` `maxConsecutiveOnes(arr[i]); ` ` ` ` ` `# Update the maximum count so far ` ` ` `ans ` `=` `max` `(ans, currMax); ` ` ` ` ` `return` `ans; ` ` ` `# Driver code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` ` ` `arr ` `=` `[ ` `1` `, ` `2` `, ` `3` `, ` `4` `]; ` ` ` `n ` `=` `len` `(arr); ` ` ` ` ` `print` `(maxOnes(arr, n)); ` ` ` `# This code is contributed by AnkitRai01 ` |

*chevron_right*

*filter_none*

## C#

`// C# implementation of the approach ` `using` `System; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to return the count of ` `// maximum consecutive 1s in the ` `// binary represntation of x ` `static` `int` `maxConsecutiveOnes(` `int` `x) ` `{ ` ` ` `// Initialize result ` ` ` `int` `count = 0; ` ` ` ` ` `// Count the number of iterations to ` ` ` `// reach x = 0. ` ` ` `while` `(x != 0) ` ` ` `{ ` ` ` `// This operation reduces length ` ` ` `// of every sequence of 1s by one ` ` ` `x = (x & (x << 1)); ` ` ` ` ` `count++; ` ` ` `} ` ` ` `return` `count; ` `} ` ` ` `// Function to return the count of ` `// maximum consecutive 1s in the ` `// binary represntation among all ` `// the elements of arr[] ` `static` `int` `maxOnes(` `int` `[]arr, ` `int` `n) ` `{ ` ` ` `// To store the answer ` ` ` `int` `ans = 0; ` ` ` ` ` `// For every element of the array ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `{ ` ` ` ` ` `// Count of maximum consecutive 1s in ` ` ` `// the binary representation of ` ` ` `// the current element ` ` ` `int` `currMax = maxConsecutiveOnes(arr[i]); ` ` ` ` ` `// Update the maximum count so far ` ` ` `ans = Math.Max(ans, currMax); ` ` ` `} ` ` ` `return` `ans; ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main(String []args) ` `{ ` ` ` `int` `[]arr = { 1, 2, 3, 4 }; ` ` ` `int` `n = arr.Length; ` ` ` ` ` `Console.WriteLine(maxOnes(arr, n)); ` `} ` `} ` ` ` `// This code is contributed by 29AjayKumar ` |

*chevron_right*

*filter_none*

**Output:**

2

## Recommended Posts:

- Minimum sub-array such that number of 1's in concatenation of binary representation of its elements is at least K
- Find consecutive 1s of length >= n in binary representation of a number
- Length of longest consecutive zeroes in the binary representation of a number.
- Find the occurrence of the given binary pattern in the binary representation of the array elements
- Maximum consecutive one’s (or zeros) in a binary array
- Maximum consecutive one’s (or zeros) in a binary circular array
- 1 to n bit numbers with no consecutive 1s in binary representation.
- 1 to n bit numbers with no consecutive 1s in binary representation
- Length of the Longest Consecutive 1s in Binary Representation
- Find next greater element with no consecutive 1 in it's binary representation
- Number of ways an array can be filled with 0s and 1s such that no consecutive elements are 1
- Maximum 0's between two immediate 1's in binary representation
- Maximum distance between two 1's in Binary representation of N
- Sum of elements in 1st array such that number of elements less than or equal to them in 2nd array is maximum
- Maximum number of contiguous array elements with same number of set bits
- Largest number dividing maximum number of elements in the array
- Binary representation of next number
- Binary representation of a given number
- Count number of trailing zeros in Binary representation of a number using Bitset
- Check if the binary representation of a number has equal number of 0s and 1s in blocks

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.