All elements in an array are Same or not?
Last Updated :
30 Aug, 2022
Given an array, check whether all elements in an array are the same or not.
Examples:
Input : "Geeks", "for", "Geeks"
Output : Not all Elements are Same
Input : 1, 1, 1, 1, 1
Output : All Elements are Same
Method 1 (Hashing): We create an empty HashSet, insert all elements into it, then we finally see if the size of the HashSet is one or not.
Implementation:
C++
#include<bits/stdc++.h>
using namespace std;
bool areSame( int a[], int n)
{
unordered_map< int , int > m;
for ( int i=0;i<n;i++)
m[a[i]]++;
if (m.size()==1)
return true ;
else
return false ;
}
int main()
{
int arr[]={1,2,3,2};
int n= sizeof (arr)/ sizeof (arr[0]);
if (areSame(arr,n))
cout<< "All Elements are Same" ;
else
cout<< "Not all Elements are Same" ;
}
|
Java
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class SameElements {
public static boolean areSame(Integer arr[])
{
Set<Integer> s = new HashSet<>(Arrays.asList(arr));
return (s.size() == 1 );
}
public static void main(String[] args)
{
Integer[] arr = { 1 , 2 , 3 , 2 };
if (areSame(arr))
System.out.println( "All Elements are Same" );
else
System.out.println( "Not all Elements are Same" );
}
}
|
Python3
def areSame(a, n):
m = {i: 0 for i in range ( len (a))}
for i in range (n):
m[a[i]] + = 1
if ( len (m) = = 1 ):
return True
else :
return False
if __name__ = = '__main__' :
arr = [ 1 , 2 , 3 , 2 ]
n = len (arr)
if (areSame(arr, n)):
print ( "All Elements are Same" )
else :
print ( "Not all Elements are Same" )
|
C#
using System;
using System.Collections.Generic;
class GFG{
public static bool areSame( int []arr)
{
HashSet< int > s = new HashSet< int >();
for ( int i = 0; i < arr.Length; i++)
s.Add(arr[i]);
return (s.Count == 1);
}
public static void Main(String[] args)
{
int [] arr = { 1, 2, 3, 2 };
if (areSame(arr))
Console.WriteLine( "All Elements are Same" );
else
Console.WriteLine( "Not all Elements are Same" );
}
}
|
Javascript
<script>
function areSame(arr)
{
let s = new Set(arr);
return (s.size == 1);
}
let arr=[1, 2, 3, 2];
if (areSame(arr))
document.write( "All Elements are Same" );
else
document.write( "Not all Elements are Same" );
</script>
|
Output
Not all Elements are Same
Complexity Analysis:
- Time Complexity: O(n)
- Auxiliary Space: O(n)
Method 2 (Compare with first): The idea is simple. We compare every other element with first. If all matches with first, we return true. Else we return false.
Implementation:
C++
#include <bits/stdc++.h>
using namespace std;
bool areSame( int arr[],
int n)
{
int first = arr[0];
for ( int i = 1; i < n; i++)
if (arr[i] != first)
return 0;
return 1;
}
int main()
{
int arr[] = {1, 2, 3, 2};
int n = sizeof (arr) /
sizeof (arr[0]);
if (areSame(arr, n))
cout << "All Elements are Same" ;
else
cout << "Not all Elements are Same" ;
}
|
Java
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class SameElements {
public static boolean areSame(Integer arr[])
{
Integer first = arr[ 0 ];
for ( int i= 1 ; i<arr.length; i++)
if (arr[i] != first)
return false ;
return true ;
}
public static void main(String[] args)
{
Integer[] arr = { 1 , 2 , 3 , 2 };
if (areSame(arr))
System.out.println( "All Elements are Same" );
else
System.out.println( "Not all Elements are Same" );
}
}
|
Python3
def areSame(arr):
first = arr[ 0 ];
for i in range ( 1 , len (arr)):
if (arr[i] ! = first):
return False ;
return True ;
if __name__ = = '__main__' :
arr = [ 1 , 2 , 3 , 2 ];
if (areSame(arr)):
print ( "All Elements are Same" );
else :
print ( "Not all Elements are Same" );
|
C#
using System;
class SameElements{
static bool areSame( int []arr)
{
int first = arr[0];
for ( int i = 1;
i < arr.Length; i++)
if (arr[i] != first)
return false ;
return true ;
}
public static void Main(String[] args)
{
int [] arr = {1, 2, 3, 2};
if (areSame(arr))
Console.WriteLine( "All Elements are Same" );
else
Console.WriteLine( "Not all Elements are Same" );
}
}
|
Javascript
<script>
function areSame(arr)
{
let first = arr[0];
for (let i=1; i<arr.length; i++)
if (arr[i] != first)
return false ;
return true ;
}
let arr=[1, 2, 3, 2 ];
if (areSame(arr))
document.write( "All Elements are Same<br>" );
else
document.write( "Not all Elements are Same<br>" );
</script>
|
Output
Not all Elements are Same
Complexity Analysis:
- Time Complexity: O(n)
- Auxiliary Space: O(1)
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...