Interested to Buy Any Domain ? << Click Here >> for more details...
Given an array of size N in which every number is between 1
and N, determine if there are any duplicates in it. You are
allowed to destroy the array if you like.
- 21 Answers
- 64286 Views
- ABC, eBay, Goldman Sachs, Google, HUP, Microsoft, TATA, I also Faced
- E-Mail Answers
Answer Posted / murugesh
If there are no duplicates, Sum of numbers should be equal
to (N(N+1))/2.
Otherwise, duplicate is present.
No duplicate:
------------
Say N = 5
{1,2,3,4,5}
5(6)/2 = 15
1+2+3+4+5 = 15
Therefore no duplicate.
Duplicate:
---------
{1,2,3,4,1}
Sum = 11
which is not equal to 15 (N(N+1)/2)
Therefore duplicate present.
| Is This Answer Correct ? | 1 Yes | 15 No |
Post New Answer View All Answers
What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql
In a gymnastic competition, scoring is based on the average of all scores given by the judges excluding the maximum and minimum scores. Let the user input the number of judges, after that, input the scores from the judges. Output the average score. Note: In case, more than two judges give the same score and it happens that score is the maximum or minimum then just eliminate two scores. For example, if the number of judges is 5 and all of them give 10 points each. Then the maximum and minimum score is 10. So the computation would be 10+10+10, this time. The output should be 10 because 30/3 is 10.
how to create a 3x3 two dimensional array that will give you the sums on the left and bottom columns
Design an implement of the inputs functions for event mode
How can you relate the function with the structure? Explain with an appropriate example.
Write a routine to implement the polymarker function
why nlogn is the lower limit of any sort algorithm?
Cluster head selection in Wireless Sensor Network using C programming language.
write a simple calculator c program to perform addition, subtraction, mul and div.
Develop a routine to reflect an object about an arbitrarily selected plane
I need your help, i need a Turbo C code for this problem.. hope u'll help me guys.? Your program will have a 3x3 array. The user will input the sum of each row and each column. Then the user will input 3 values and store them anywhere, or any location or index, temporarily in the array. Your program will supply the remaining six (6) values and determine the exact location of each value in the array. Example: Input: Sum of row 1: 6 Sum of row 2: 15 Sum of row 3: 24 Sum of column 1: 12 Sum of column 2: 15 Sum of column 3: 18 Value 1: 3 Value 2: 5 Value 3: 6 Output: Sum of Row 1 2 3 6 4 5 6 15 7 8 9 24 Sum of Column 12 15 18 Note: Your program will not necessary sort the walues in the array Thanks..
write a c program to input initial & final time in the format hh:mm and find the time intervel between them? Ex inputs are initial 06:30 final 00:05 and 23:22 final 22.30
How to palindrom string in c language?
why do you use macros? Explain a situation where you had to incorporate macros in your proc report? use a simple instream data example with code ?
How do you verify if the two sentences/phrases input is an anagram using predefined functions in string.h and by using arrays?
