Dsa
Hashing
Easy
Unique Element Finder
Given an array of integers, find all the unique elements that appear exactly once in the array and return them in a list sorted in ascending order.
Input Format:
The first line will consist of an integer n, the size of the array.
The second line contains n space-separated integers, the elements of the array.
Output Format:
Print the unique numbers in ascending order, space-separated on a single line.
Example:
Input:
6
4 5 6 4 5 7
Output:
6 7
Key concepts
hashingarraysset operations
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now