insidcode
ProblemsDuelLeaderboardStats
Sign In
  1. Home
  2. Problems
  3. Find elements that are in one array but not in the other.

Find elements that are in one array but not in the other.

Difficulty: Hard

Phase: 4 · Basic Arrays

XP Reward: 30 XP

Topics: Basic Arrays, Hard

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

Problem Description

Given array A followed by array B, print elements present in A but not in B (unique, in order of appearance in A). 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: 4 1 2 3 4 2 3 4

Output: 1 2

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