Write an algorithm / Java Program to show duplicates in an array of n elements?

Interview Questions and Answers

Q1. Write an algorithm / Java Program to show duplicates in an array of n elements?

Ans. int duplicateArray[] = { 1, 2, 2, 3, 4, 5, 6, 8, 9}
Set unique = new HashSet();
for (int i = 0; i < duplicateArray.length; i) {
if (unique.contains(duplicateArray[i])) {
System.out.println(duplicateArray[i]);
} else {
unique.add(duplicateArray[i]);
}
}

Complexity O(n) = nHashSet contains and add has O(n) = 1

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve coding code Asked in 2 Companies}

Related Questions

What are the steps to be performed while coding Junit with Mocking framework ?

What is a Sequence File?

What different level of logging you use while coding ?

Have you ever encoded the response before sending it back from the service? If Yes , Which encoding was used ?

What are the different type of encoding you have used ?

How does encoding affect using Reader / writer classes or Stream classes in Java ?

What is the difference between html encoding and url encoding ?

Does spaces get's encoded in html encoding ?

Search Interview Questions

Help us and Others Improve. Please let us know the questions asked in any of your previous interview.