## Find Index of Maximum Occurring Element with Equal Probability

Given a collection of integers, develop an algorithm to find the index of maximum occurring element with equal probability.

Coding made easy

Given a collection of integers, develop an algorithm to find the index of maximum occurring element with equal probability.

Given an array of integers, check if an array is formed by consecutive integers.

Given an array of integers where every element appears even number of times except one element which appears odd number of times, find that odd occurring element in O(log(n)) time and constant space.

Given an unsorted array of integers, find two non-overlapping pairs in it having same sum.

In this post, we will see how to right rotate an array by specified positions. For example, right rotating the array { 1, 2, 3, 4, 5, 6, 7 } three times will result in the array { 5, 6, 7, 1, 2, 3, 4 }.

In this post, we will see how to left rotate an array by specified positions. For example, left rotating the array { 1, 2, 3, 4, 5 } twice results in the array { 3, 4, 5, 1, 2 }.

Find the minimum number of moves required for converting an array of zeroes to a given array using only increment and double operations. The increment operation increases the value of an element in the array by 1 and the double operation doubles the value of each element in the array.

Given a sequence of numbers such that the difference between the consecutive terms is constant, find missing term in it in O(log(n)) time.

Given an array of integers, find subarrays with given sum in it.

In this post, we will discuss the difference between Arrays and Collections in Java.

Given a set S, generate all distinct subsets of it i.e., find distinct power set of set S. A power set of any set S is the set of all subsets of S, including the empty set and S itself.

Given a sorted array of integers, find floor and ceil of a given number in it. The floor and ceiling map the given number to the largest previous or the smallest following integer, respectively.