# A ‘array palindrome’ is an array which, when its elements are reversed, remains the same (i.e., the elements of the array are same when scanned forward or backward) Write a recursive, boolean-valued method, isPalindrome, that accepts an integer -valued array , and a pair of integers representing the starting and ending indexes of the portion of the array to be tested for being a palindrome. The function returns whether that portion of the array is a palindrome. An array is a palindrome if: the array is empty (0 elements ) or contains only one element (which therefore is the same when reversed), or the first and last elements of the array are the same, and the rest of the array (i.e., the second through next-to-last elements) form a palindrome.

### Challenge:

A ‘array palindrome’ is an array which, when its elements are reversed, remains the same (i.e., the elements of the array are same when scanned forward or backward) Write a recursive, boolean-valued method, isPalindrome, that accepts an integer-valued  array , and a pair of integers representing the starting and ending indexes of the portion of the array  to be tested for being a palindrome. The function returns whether that portion of the array is a palindrome.

An array is a palindrome if:
the array is empty (0 elements ) or contains only one element (which therefore is the same when reversed), or
the first and last elements of the array are the same, and the rest of the array (i.e., the second through next-to-last elements ) form a palindrome.

### Solution:

```
public boolean isPalindrome(int[] a, int start, int end){
int length = end - start + 1;
if (length == 0 || length == 1) {
return true;
} else if(a[start] != a[end]) {
return false;
} else
return isPalindrome(a, start+1, end-1);
}

```