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. [ I ended up giving about 4 or
5 different solutions for this, each supposedly better than the
others ].
Answer Posted / sujan_faith
<!--i have just replaced the same array element with
the value zero but alse we can destroy that element-->>
#include<iostream>
#define size 10
using namespace std;
int main()
{
int a[10]={10,10,10,2,1,1,1,1,1,2};
int j=1;
for(int i=0;i<size;i++)
{
for(int k=i+1;k<size;k++)
{
if(a[i]==a[k]&&a[i]!=0)
{
a[k]=0;
j++;
}
if(k==(size-1)&& a[i]!=0)
cout<<"Value is: "<<a[i]<<" which is repeated "<<j<<" times"<<endl;
}
j=1;
}
system("pause");
}
| Is This Answer Correct ? | 8 Yes | 0 No |
Post New Answer View All Answers
Write about the role of c++ in the tradeoff of safety vs. Usability?
Refer to a name of class or function that is defined within a namespace?
What is the use of vtable?
What are proxy objects in c++?
Explain object slicing in c++?
How many types of modularization are there in c++?
What is the difference between while and do while loop?
What is the oldest programming language?
What is c++ prototype?
What are advantages of using friend classes?
What is an object in c++?
Write a program to find the Fibonacci series recursively.
We use library functions in the program, in what form they are provided to the program?
Why c++ does not have finally?
What is the most common mistake on c++ and oo projects?