Mobile coding works. A laptop is faster for long sessions.
Problem
Given an array of integers, count how many distinct values are present using pointers. Assume all numbers are between -1000 and 1000.
Input format
Input
input.txt
- First line: integer N (1 ≤ N ≤ 100) - Second line: N space-separated integers
Output format
Output
output.txt
- Single integer: count of distinct numbers
Example
input
6 1 2 2 3 1 4
output
4
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
6 1 2 2 3 1 4
Expected output
4
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc