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 / 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 |
Is arr and &arr are same expression for an array?
Explain how to initialize a const data member.
What are the basics of classifying different storage types, why?
2 Answers Astergate, Symphony,
How do you differentiate between overloading the prefix and postfix increments?
what is COPY CONSTRUCTOR and what is it used for?
Should a constructor be public or private?
What is ostream in c++?
What is different in C++, compare with unix?
What is the purpose of templates in c++?
What is endl?
What is null c++?
Do you know what are static and dynamic type checking?