Find number of pairs in an array such that their XOR is 0

The problem “Find number of pairs in an array such that their XOR is 0” state that supposes, we have given an array of integers. The problem statement asks to find out the number of pairs present in an array, which has the pair Ai XOR Aj = 0. Note: …

Read moreFind number of pairs in an array such that their XOR is 0

Find whether a subarray is in form of a mountain or not

Problem Statement The problem “Find whether a subarray is in form of a mountain or not” states that you are given an integer array and a range. The problem statement asks to find out whether the sub-array formed between the given range is in form of a mountain form or …

Read moreFind whether a subarray is in form of a mountain or not

Distance of nearest cell having 1 in a binary matrix

Problem Statement The problem “Distance of nearest cell having 1 in a binary matrix” states that you are given a binary matrix(containing only 0s and 1s) with at least one 1. Find the distance of the nearest cell having 1 in the binary matrix for all the elements of the …

Read moreDistance of nearest cell having 1 in a binary matrix

Count subarrays having total distinct elements same as original array

Problem Statement “Count subarrays having total distinct elements same as original array” states that you are given an integer array. The problem statement asks to find out the total number of sub-arrays that contain all distinct elements as present in an original array. Example arr[] = {2, 1, 3, 2, …

Read moreCount subarrays having total distinct elements same as original array

Count pairs from two sorted arrays whose sum is equal to a given value x

Problem Statement “Count pairs from two sorted arrays whose sum is equal to a given value x” problem states that you are given two sorted arrays of integers and an integer value called sum. The problem statement asks to find out the total number of pair which sums up to …

Read moreCount pairs from two sorted arrays whose sum is equal to a given value x

Collect maximum points in a grid using two traversals

Problem Statement We are given a matrix of size “n x m”, and we need to collect maximum points in a grid using two traversals. If we are standing at cell i,j then we have three options to go to cell i+1, j or i+1, j-1or i+1, j+1. That is …

Read moreCollect maximum points in a grid using two traversals