🔢Java Arrays Programs

Adds two matrices of the same size by summing the values at each matching row and column.

Calculates the average of an array's elements.

Determines whether an array's elements are in ascending order.

Checks whether two arrays hold the same elements in the same order.

Joins two arrays end to end into a single array.

Creates an independent copy of an array.

Counts how many even numbers appear in an array.

Counts how many negative numbers appear in an array.

Counts how many odd numbers appear in an array.

Counts how many positive numbers appear in an array.

Counts how many zero values appear in an array.

Declares an array and prints every element it holds.

Scans an array to find its largest value.

Scans an array to find its second-largest value.

Scans an array to find its second-smallest value.

Scans an array to find its smallest value.

Adds up the primary and secondary diagonals of a square matrix separately.

Scans an array to find its third-largest value.

Searches an array for a target value by checking every element in order.

Moves every zero in an array to the end, keeping the non-zero elements in order.

Reads an array's size and elements from the console.

Removes repeated elements from an array, keeping each one's first occurrence.

Reverses the elements of an integer array in place.

Rotates an array's elements to the left by a given number of positions.

Rotates an array's elements to the right by a given number of positions.

Splits an array's elements into separate lists of even and odd numbers.

Splits an array's elements into separate lists of positive and negative numbers.

Sorts an array into ascending order using the built-in sort method.

Sorts an array into descending order.

Adds up every element of an array.

Flips a matrix over its main diagonal so that every row becomes a column.

Searches a sorted array for a target value by repeatedly halving the search range.

Sorts an array by repeatedly swapping adjacent out-of-order elements.

Sorts small-range integers without comparisons by tallying how often each value appears.

Finds every element that appears more than once in an array.

Finds the index where the sum of elements to its left equals the sum to its right.

Counts how many times each element appears in an array.

Finds every element that appears in both of two arrays.

Finds every element that is greater than all the elements to its right.

Finds the element that appears least often in an array.

Finds an element that is smaller than both of its neighbors.

Finds the largest value obtainable by subtracting an earlier element from a later one.

Finds the smallest absolute difference between any two elements in an array.

Finds the smallest sum achievable by any contiguous subarray.

Finds the single missing number from a sequence of 1 to n.

Finds the element that appears most often in an array.

Finds two numbers in an array that add up to a target sum.

Finds an element that is greater than both of its neighbors.

Finds the single number that repeats in an array of n + 1 values from 1 to n.

Finds a contiguous subarray whose elements add up to a target sum.

Finds every distinct element present in either of two arrays.

Finds the single element that appears once while every other element appears exactly twice.

Sorts an array by inserting each element into its correct position among the ones already sorted.

Sorts an array by splitting it in half, sorting each half recursively and merging the sorted halves.

Merges two sorted arrays into a single sorted array.

Rearranges an array in place so every negative number comes before the positives.

Multiplies two matrices by pairing each row of the first with each column of the second.

Reads a matrix clockwise from the outside in, peeling off one ring of cells at a time.

Sorts an array by partitioning it around a pivot, then sorting the smaller and larger sides recursively.

Rotates an array by k positions in place using the reversal algorithm.

Sorts an array by repeatedly selecting the smallest remaining element.

Finds the kth largest value in an array with a size-k min-heap, without sorting the whole array.

Finds the length of the longest run of consecutive integers in an unsorted array.

Finds the element that appears more than half the time in an array.

Finds the largest product achievable by any contiguous subarray.

Finds the largest sum achievable by any contiguous subarray, using Kadane's algorithm.

Finds three numbers in an array that add up to a target sum.

Sorts an array by arranging it as a max-heap and repeatedly moving the largest value to the end.