Find the duplicate element most number of times in array of 0 to n-1

 Posted on April 4, 2014  (Last modified on August 7, 2020)  |  3 minutes  |  Kinshuk Chandra

Problem Given an array of n numbers from 0 to n-1, find the element occurring most number of times Solution This problem is similar to following problem : Find the two repeating elements in a given array We can use some of the method used there. Method 1 - Brute force Here we will match the adjacent elements, and increment the count accordingly. Here is the code public int maxDuplicateItemBruteForce(int A){ int n = A. [Read More]
search  kodeknight  ranged-array  duplicate 

Check if array contains duplicates

 Posted on March 31, 2014  (Last modified on August 7, 2020)  |  3 minutes  |  Kinshuk Chandra

**Problem ** Given an array of n elements, check if it has duplicates Solution This problem is similar to following problem : Find the two repeating elements in a given array We can use some of the method used there. Method 1 - Brute force Use two loops. In the outer loop, pick elements one by one and count the number of occurrences of the picked element in the inner loop. [Read More]
search  kodeknight  ranged-array  duplicate 

Find duplicates in the ranged array

 Posted on March 31, 2014  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

Problem Given an array of n elements which contains elements from 0 to n-1, with any of these numbers appearing any number of times. Follow UP - Find these repeating numbers in O(n) and using only constant memory space. Example Input : array = {1, 2, 3, 1, 3, 6, 6}, n = 7 Output = 1,3,6 Solution This problem is an extended version of following problem. Find the two repeating elements in a given array [Read More]
search  kodeknight  ranged-array  duplicate 

Find the two repeating elements in ranged array

 Posted on March 31, 2014  (Last modified on August 7, 2020)  |  7 minutes  |  Kinshuk Chandra

Problem You are given an array of n+2 elements. All elements of the array are in range 1 to n. And all elements occur once except two numbers which occur twice. Find the two repeating numbers. Example Input : array = {4, 2, 4, 5, 2, 3, 1} and n = 5, array.length = n+2 = 7 Output : 4,2 Solution This can be achieved by various methods. [Read More]
search  kodeknight  ranged-array  duplicate 

Find the two non-repeating elements in a ranged array of repeating elements

 Posted on March 31, 2014  (Last modified on August 7, 2020)  |  3 minutes  |  Kinshuk Chandra

Problem Given an array in which all numbers except two are repeated once. (i.e. we have 2n+2 numbers and n numbers are occurring twice and remaining two have occurred once). Find those two numbers in the most efficient way. Example Input : {2,4,7,9,2,4} Output : 7,9 Solution Method 1 - Use Sorting First sort all the elements. In the sorted array, by comparing adjacent elements we can easily get the non-repeating elements. [Read More]
search  kodeknight  ranged-array  duplicate 

Find the First Duplicated Integer in an Array containing numbers from 1 to N Without Using Extra Memory

 Posted on January 5, 2012  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

let the array be 3 1 2 1 3 4 first repeated integ… Unknown - Mar 6, 2013let the array be 3 1 2 1 3 4 first repeated integer is 3 here start from the first and go till the end add n+1 to the a[a[i]] where i is the current index. iterate again dividing the values by n+1 if values comes 1 . the remainder is the repeated one. [Read More]
kodeknight  ranged-array  duplicate  incomplete  array  integer-array 

Find the First Duplicated Integer in an Array containing numbers from 1 to N Without Using Extra Memory

 Posted on January 5, 2012  (Last modified on August 7, 2020)  |  4 minutes  |  Kinshuk Chandra

Question: There is a size-N array of integers whose values range from 1 to N. Some integers are duplicated. Find the first duplicate and its index without using any extra memory (not even O(1)). Solution There are a few keys in the question that we should consider: The array size is a finite number N which is also the upper limit for any integer inside the array. Hence, if the array size is 10, then there are ten elements in the array and each of those elements is between 1 and 10. [Read More]
kodeknight  ranged-array  duplicate  incomplete  array  integer-array 

Given numbers from 1 to N+1, with number being from 1 and N and one of the number being repeatative. Find the repeating element.

 Posted on September 30, 2011  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

Suppose you have an array of 1001 integers. The integers are in random order, but you know each of the integers is between 1 and 1000 (inclusive). In addition, each number appears only once in the array, except for one number, which occurs twice. Assume that you can access each element of the array only once. Describe an algorithm to find the repeated number. If you used auxiliary storage in your algorithm, can you find an algorithm that does not require it? [Read More]
kodeknight  ranged-array  duplicate  array 

Given an array of n integers from 1 to n with one integer repeated twice

 Posted on January 5, 2010  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

Problem - Given an array of n integers from 1 to n with one integer repeated twice This can be done via normal array traversal or hash table to find duplicates. But since we are given that the integers are from 1 to n, then there are better methods available. Approach 1 - Arithmetic sum approach So, the efficient method to solve it calculate the sum of actual input array, and expected sum of the array. [Read More]
integer series  kodeknight  ranged-array  duplicate  integer  programming  Interview Question  array  integer-array