Find the minimum difference between the index of two given elements present in an array
Given two integers, find the minimum difference between their index in a given array in linear time and a single traversal of the array.
Tag: Easy
Partition an array into two subarrays with the same sum
Given an integer array, partition it into two subarrays having the same sum of elements.
Replace each array element by its corresponding rank
Given an array of distinct integers, replace each array element by its corresponding rank in the array. The minimum array element has the rank 1; the second minimum element has a rank of 2, and so on…
Print binary representation of a number – C, C++, Java, and Python
Print binary representation of a given number in C, C++, Java, and Python using built-in methods and custom routines.
Find the minimum index of a repeating element in an array
Given an integer array, find the minimum index of a repeating element in linear time and doing just one traversal of the array.
Find a pair with a minimum absolute sum in an array
Given a sorted integer array, find a pair in it having an absolute minimum sum.
Clone a Binary Tree
Given a binary tree, efficiently clone of it.
Merge two sorted arrays from their end
Given two sorted integer arrays, merge them into a single array in decreasing order, and return it. In other words, merge two sorted arrays from their end.
Merge two sorted arrays
Given two integer arrays, each of which is sorted in increasing order, merge them into a single array in increasing order, and return it.
Find an index of the maximum occurring element with equal probability
Given an integer array, find the index of the maximum occurring element with an equal probability.
Count all paths in a matrix from the first cell to the last cell
Given an M × N rectangular grid, efficiently count all paths starting from the first cell (0, 0) to the last cell (M-1, N-1). We can either move down or move towards right from a cell.
Find the square root of a number using a binary search
Given a positive number, find the square root of it. If the number is not a perfect square, then return the floor of its square root.