Find the intersection of two sorted arrays in linear time using two pointers.

Difficulty: Hard

Phase: 6 · Mixed Logical Challenges

XP Reward: 30 XP

Topics: Mixed Logical Challenges, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given two sorted arrays, find their intersection elements using two pointers and print separated by space. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 5 1 2 2 3 4 4 2 2 4 6

Output: 2 2 4

Explanation: Sample execution for input 5 1 2 2 3 4 4 2 2 4 6