# Longest subarray with all elements same

Given an array arr[] of size N, the task is to find the largest subarray which consists of all equal elements.

Examples:

Input: arr[] = {1, 1, 2, 2, 2, 3, 3};
Output: 3
Explanation:
Longest subarray with equal elements is {2, 2, 2}

Input: arr[] = {1, 1, 2, 2, 2, 3, 3, 3, 3};
Output: 4
Explanation:
Longest subarray with equal elements is {3, 3, 3, 3}

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: The idea is to traverse the array and check that the current element is equal to the previous element or not. If yes then increment the length of the longest subarray by 1. Otherwise, the current longest subarray is equal to 1. Also, update the longest subarray with equal elements at each step of the iteration.

Below is the implementation of the above approach:

## C++

 `// C++ program to find largest ` `// subarray with all equal elements. ` ` `  `#include ` `using` `namespace` `std; ` ` `  `// Function to find largest sub ` `// array with all equal elements. ` `int` `subarray(``int` `arr[], ``int` `n) ` `{ ` ` `  `    ``int` `ans = 1, temp = 1; ` ` `  `    ``// Traverse the array ` `    ``for` `(``int` `i = 1; i < n; i++) { ` ` `  `        ``// If elemet is same as ` `        ``// previous increment temp value ` `        ``if` `(arr[i] == arr[i - 1]) { ` `            ``++temp; ` `        ``} ` `        ``else` `{ ` `            ``ans = max(ans, temp); ` `            ``temp = 1; ` `        ``} ` `    ``} ` `    ``ans = max(ans, temp); ` ` `  `    ``// Return the required answer ` `    ``return` `ans; ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` `    ``int` `arr[] = { 2, 2, 1, 1, ` `                  ``2, 2, 2, 3, 3 }; ` `    ``int` `n = ``sizeof``(arr) / ``sizeof``(arr); ` ` `  `    ``// Function call ` `    ``cout << subarray(arr, n); ` ` `  `    ``return` `0; ` `} `

## Java

 `// Java program to find largest ` `// subarray with all equal elements. ` `import` `java.util.*; ` ` `  `class` `GFG{ ` ` `  `// Function to find largest sub ` `// array with all equal elements. ` `static` `int` `subarray(``int` `arr[], ``int` `n) ` `{ ` `    ``int` `ans = ``1``, temp = ``1``; ` ` `  `    ``// Traverse the array ` `    ``for``(``int` `i = ``1``; i < n; i++) ` `    ``{ ` `         `  `       ``// If elemet is same as ` `       ``// previous increment temp value ` `       ``if` `(arr[i] == arr[i - ``1``])  ` `       ``{ ` `           ``++temp; ` `       ``} ` `       ``else` `       ``{ ` `           ``ans = Math.max(ans, temp); ` `           ``temp = ``1``; ` `       ``} ` `    ``} ` `    ``ans = Math.max(ans, temp); ` ` `  `    ``// Return the required answer ` `    ``return` `ans; ` `} ` ` `  `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` `    ``int` `arr[] = { ``2``, ``2``, ``1``, ``1``, ``2``, ` `                  ``2``, ``2``, ``3``, ``3` `}; ` `    ``int` `n = arr.length; ` ` `  `    ``// Function call ` `    ``System.out.print(subarray(arr, n)); ` `} ` `} ` ` `  `// This code is contributed by AbhiThakur `

## Python3

 `# Python3 program to find largest ` `# subarray with all equal elements. ` ` `  `# Function to find largest sub ` `# array with all equal elements. ` `def` `subarray(arr, n): ` `     `  `    ``ans, temp ``=` `1``, ``1` ` `  `    ``# Traverse the array ` `    ``for` `i ``in` `range``(``1``, n): ` ` `  `        ``# If element is same as previous ` `        ``# increment temp value ` `        ``if` `arr[i] ``=``=` `arr[i ``-` `1``]: ` `            ``temp ``=` `temp ``+` `1` `        ``else``: ` `            ``ans ``=` `max``(ans, temp) ` `            ``temp ``=` `1` `                 `  `    ``ans ``=` `max``(ans, temp) ` ` `  `    ``# Return the required answer ` `    ``return` `ans ` ` `  `# Driver code ` `arr ``=` `[ ``2``, ``2``, ``1``, ``1``, ``2``, ` `        ``2``, ``2``, ``3``, ``3` `] ` `n ``=` `len``(arr) ` ` `  `# Function call ` `print``(subarray(arr, n)) ` ` `  `# This code is contributed by jrishabh99 `

## C#

 `// C# program to find largest ` `// subarray with all equal elements. ` `using` `System; ` `class` `GFG{ ` ` `  `// Function to find largest sub ` `// array with all equal elements. ` `static` `int` `subarray(``int``[] arr, ``int` `n) ` `{ ` `    ``int` `ans = 1, temp = 1; ` ` `  `    ``// Traverse the array ` `    ``for``(``int` `i = 1; i < n; i++)  ` `    ``{ ` `         `  `       ``// If elemet is same as ` `       ``// previous increment temp value ` `       ``if` `(arr[i] == arr[i - 1]) ` `       ``{ ` `           ``++temp; ` `       ``} ` `       ``else`  `       ``{ ` `           ``ans = Math.Max(ans, temp); ` `           ``temp = 1; ` `       ``} ` `    ``} ` `    ``ans = Math.Max(ans, temp); ` `     `  `    ``// Return the required answer ` `    ``return` `ans; ` `} ` ` `  `// Driver code ` `public` `static` `void` `Main() ` `{ ` `    ``int``[] arr = { 2, 2, 1, 1, 2, ` `                  ``2, 2, 3, 3 }; ` `    ``int` `n = arr.Length; ` ` `  `    ``// Function call ` `    ``Console.Write(subarray(arr, n)); ` `} ` `} ` ` `  `// This code is contributed by Nidhi_biet `

Output:

```3
```

Time Complexity: O(N)

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

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.