Top 50 Java Array Interview Questions with
Answers & Code Examples
■ Basic Array Interview Questions
1. What is an array in Java?
An array is a data structure that stores a fixed-size sequence of elements of the same type. It
allows random access using an index. Example:
Example:
int[] arr = {1, 2, 3, 4, 5};
2. How is an array different from an ArrayList?
An array has a fixed size, while an ArrayList can grow or shrink dynamically. Arrays store primitives
or objects; ArrayList stores only objects.
3. How do you declare and initialize an array?
You can declare and initialize an array as:
int[] arr = new int[5];
Or directly:
int[] arr = {10, 20, 30};
4. What is the default value of array elements in Java?
Default values depend on the data type:
- int → 0
- double → 0.0
- boolean → false
- object → null
5. Can you change the size of an array once created?
No, arrays in Java are fixed in size. To resize, create a new array and copy elements.
■■ Intermediate Array Interview Questions
6. How do you copy one array into another?
Using [Link]() or [Link]().
Example:
[Link](a, 0, b, 0, [Link]);
7. How do you sort an array?
Use [Link](arr); for ascending order.
For descending order:
[Link](arr, [Link]());
8. How do you find duplicates in an array?
Use nested loops or a Set.
Example:
for(int i=0;i
9. How do you find the largest and smallest element?
Iterate through array and track max/min values.
Example:
for(int n:arr){ if(n>max)max=n; if(n
10. How do you check if two arrays are equal?
Use [Link](arr1, arr2); for 1D arrays or [Link]() for multidimensional arrays.
■ Advanced Array Interview Questions
11. How do you find missing numbers in a sequence?
Find total using formula n*(n+1)/2 and subtract array sum.
Example:
int missing = total - sum;
12. How do you rotate an array?
Right rotation:
int last = arr[[Link]-1]; for(int i=[Link]-1;i>0;i--) arr[i]=arr[i-1]; arr[0]=last;
13. How do you check if array is palindrome?
Compare arr[i] with arr[[Link]-1-i] for all i.
If all match → Palindrome.
14. What is Kadane’s Algorithm?
Used to find maximum sum subarray.
Example:
for(int i=0;i
15. How do you find leaders in an array?
An element is a leader if it’s greater than all elements to its right.
for(int i=0;i