Mobile coding works. A laptop is faster for long sessions.
Problem
Given two arrays, print all elements that appear in both arrays, in increasing order, without duplicates.
Input format
Input
input.txt
- The first line contains N and M (1 ≤ N, M ≤ 100). - The second line contains N integers (-1000 ≤ Ai ≤ 1000). - The third line contains M integers (-1000 ≤ Bi ≤ 1000).
Output format
Output
output.txt
- The sorted intersection (no duplicates), space-separated.
Example
input
4 5 1 2 3 4 3 4 4 5 6
output
3 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
4 5 1 2 3 4 3 4 4 5 6
Expected output
3 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