# Category: Array

## Reverse array in subset of N in Java

Problem: Reverse array in subset of N. For example: input: Array = , N = 3 output: The array is divided in 3 subsets , and . Now …

## Sherlock and array Hackerrank solution in Java

Problem: Watson gives Sherlock an array A of length N. Then he asks him to determine if there exists an element in the array such that the sum of the …

## Plus minus hackerrank solution

Problem: Given an array of integers, calculate which fraction of the elements are positive, negative, and zeroes, respectively. Print the decimal value of each fraction. This problem was asked in …

## Diagonal difference in Java

Problem: Given a square matrix of size N×N, calculate the absolute difference between the sums of its diagonals. This question was asked in HackerRank. We will see a simple and elegent …

## Find sum of elements of array

You are given an array of integers of size N *N. Find the sum of elements in array? Accept the input from console. This is the simple array program …

## Find minimum distance to reach nearest 0

Problem: Given a matrix of -1’s and 0’s, display matrix which contains minimum distance to reach nearest 0 for that particular position. Example: Input matrix: -1 0 -1 -1 -1 …

## Find two numbers that add to a sum in an array in Java

Problem: Write a Java program to find two numbers that add to a sum in an array. A solution of time complexity Ο(n) is expected. Example: If the input …

## Distinct elements in an array

Problem: Write a Java program to find distinct elements in an array. For example, if input array is { 2, 4, 3, 2, 6, 9, 4, 6 } then, …

## Maximum repeating element in an array in Java

Problem: Write a Java program to find maximum repeating element in an array of integers in Java. Or write a program to find most popular element in an array. …

## Sort elements by frequency

Problem: Sort elements by frequency. Sort elements of an array by frequency of the elements of the array. Sort the elements by decreasing order of their frequency. If two …