Check if all elements of the array are palindrome or not - GeeksforGeeks

02 Jun, 2021
Given an array arr[] of N elements. The task is to check if the array is PalinArray or not i.e., if all elements of array are palindrome or not. Examples:  
Input: arr[] = {121, 131, 20} Output: Array is not a PalinArray For the given array, element 20 is not a palindrome. Thus the array is not a PalinArray.Input: arr[] = {111, 121, 222, 333, 444} Output: Array is a PalinArray For the given array, all the elements of the array are palindromes. Thus the array is a PalinArray.  
 
Approach:  
Traverse all elements of the given array and check if each is a palindrome or not.
If yes, print Array is a PalinArray.
Else, print Array is not a PalinArray.
Below is the implementation of the above approach:  
C++
Java
Python3
C#
PHP
Javascript
// CPP implementation to check// if an array is PalinArray or not#include<bits/stdc++.h>using namespace std;     // Function to check if palindrome or not    bool isPalindrome(int N)    {        string str = "" + N;        int len = str.length();        for (int i = 0; i < len / 2; i++) {            if (str[i] != str[len - 1 - i])                return false;        }        return true;    }     // Function to check    // if an array is PalinArray or not    bool isPalinArray(int arr[] , int n)    {        // Traversing each element of the array        // and check if it is palindrome or not        for (int i = 0; i < n; i++) {            bool ans = isPalindrome(arr[i]);            if (ans == false)                return false;        }        return true;    }     // Driver code    int main()    {        int arr[] = { 121, 131, 20 };         // length of array        int n = sizeof(arr)/sizeof(arr[0]);         bool res = isPalinArray(arr, n);        if (res == true)            cout<<"Array is a PalinArray";        else            cout<<"Array is not a PalinArray";    } // This code is contributed by// Surendra_Gangwar
// Java implementation to check// if an array is PalinArray or notclass GFG {     // Function to check if palindrome or not    static boolean isPalindrome(int N)    {        String str = "" + N;        int len = str.length();        for (int i = 0; i < len / 2; i++) {            if (str.charAt(i) != str.charAt(len - 1 - i))                return false;        }        return true;    }     // Function to check    // if an array is PalinArray or not    static boolean isPalinArray(int[] arr, int n)    {        // Traversing each element of the array        // and check if it is palindrome or not        for (int i = 0; i < n; i++) {            boolean ans = isPalindrome(arr[i]);            if (ans == false)                return false;        }        return true;    }     // Driver code    public static void main(String args[])    {        int[] arr = { 121, 131, 20 };         // length of array        int n = arr.length;         boolean res = isPalinArray(arr, n);        if (res == true)            System.out.println("Array is a PalinArray");        else            System.out.println("Array is not a PalinArray");    }}
# Python3 implementation to check# if an array is PalinArray or not # Function to check if palindrome or notdef isPalindrome(N):    str1 = "" + str(N)    len1 = len(str1)    for i in range(int(len1 / 2)):        if (str1[i] != str1[len1 - 1 - i]):            return False    return True # Function to check# if an array is PalinArray or notdef isPalinArray(arr, n):         # Traversing each element of the array    # and check if it is palindrome or not    for i in range(n):        ans = isPalindrome(arr[i])        if (ans == False):            return False    return True     # Driver codeif __name__ == '__main__':         arr = [ 121, 131, 20 ]         # length of array    n = len(arr)    res = isPalinArray(arr, n)    if (res == True):        print("Array is a PalinArray")    else:        print("Array is not a PalinArray") # This code is contributed by PrinciRaj1992
// C# implementation to check// if an array is PalinArray or notusing System; class GFG{ // Function to check if palindrome or notstatic bool isPalindrome(int N){    string str = "" + N;    int len = str.Length;    for (int i = 0; i < len / 2; i++)    {        if (str[i] != str[len - 1 - i ])            return false;    }    return true;} // Function to check if an array is// PalinArray or notstatic bool isPalinArray(int[] arr, int n){    // Traversing each element of the array    // and check if it is palindrome or not    for (int i = 0; i < n; i++)    {        bool ans = isPalindrome(arr[i]);        if (ans == false)            return false;    }    return true;} // Driver codepublic static void Main(){    int[] arr = { 121, 131, 20 };     // length of array    int n = arr.Length;     bool res = isPalinArray(arr, n);    if (res == true)        Console.WriteLine("Array is a PalinArray");    else        Console.WriteLine("Array is not a PalinArray");}} // This code is contributed by Ryuga
<?php// PHP implementation to check// if an array is PalinArray or not // Function to check if palindrome or notfunction isPalindrome($N){    $str = "" . $N;    $len = strlen($str);    for ($i = 0; $i < $len / 2; $i++)    {        if ($str[$i] != $str[$len - 1 - $i])            return false;    }    return true;} // Function to check if an array is// PalinArray or notfunction isPalinArray($arr , $n){    // Traversing each element of the array    // and check if it is palindrome or not    for ($i = 0; $i < $n; $i++)    {        $ans = isPalindrome($arr[$i]);        if ($ans == false)            return false;    }    return true;} // Driver code$arr = array(121, 131, 20); // length of array$n = sizeof($arr); $res = isPalinArray($arr, $n);if ($res == true)    echo "Array is a PalinArray";else    echo "Array is not a PalinArray"; // This code is contributed by// Akanksha Rai?>
<script>    // Javascript implementation to check    // if an array is PalinArray or not         // Function to check if palindrome or not    function isPalindrome(N)    {        let str = "" + N;        let len = str.length;        for (let i = 0; i < parseInt(len / 2, 10); i++)        {            if (str[i] != str[len - 1 - i ])                return false;        }        return true;    }     // Function to check if an array is    // PalinArray or not    function isPalinArray(arr, n)    {        // Traversing each element of the array        // and check if it is palindrome or not        for (let i = 0; i < n; i++)        {            let ans = isPalindrome(arr[i]);            if (ans == false)                return false;        }        return true;    }         let arr = [ 121, 131, 20 ];       // length of array    let n = arr.length;       let res = isPalinArray(arr, n);    if (res == true)        document.write("Array is a PalinArray");    else        document.write("Array is not a PalinArray"); // This code is contributed by decode2207.</script>
Array is not a PalinArray
 
SURENDRA_GANGWAR
ankthon
Akanksha_Rai
princiraj1992
decode2207
palindrome
Arrays
Technical Scripter
Arrays
palindrome
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Comments
Old Comments
Next Greater Element
Window Sliding Technique
Count pairs with given sum
Program to find sum of elements in a given array
Reversal algorithm for array rotation
Find subarray with given sum | Set 1 (Nonnegative Numbers)
Building Heap from Array
Remove duplicates from sorted array
Sliding Window Maximum (Maximum of all subarrays of size k)
Move all negative numbers to beginning and positive to end with constant extra space