# HackerRank Symmetric Difference solution in python

In this Symmetric Difference problem solution in python, If the inputs are given on one line separated by a character (the delimiter), use split() to get the separate values in the form of a list. The delimiter is space (ascii 32) by default. To specify that comma is the delimiter, use string.split(','). For this challenge, and in general on HackerRank, space will be the delimiter.

Given 2 sets of integers, M and N, print their symmetric difference in ascending order. The term symmetric difference indicates those values that exist in either M or N but do not exist in both.

## Problem solution in Python 2 programming.

```n=int(raw_input())
my=set(map(int,raw_input().split()))
m=int(raw_input())
my2=set(map(int,raw_input().split()))
for i in sorted(my.union(my2)):
if i not in my.intersection(my2):
print i```

## Problem solution in Python 3 programming.

```# Enter your code here. Read input from STDIN. Print output to STDOUT
a,b = [set(input().split()) for _ in range(4)][1::2]
print('\n'.join(sorted(a^b, key=int)))```

### Problem solution in pypy programming.

```# Enter your code here. Read input from STDIN. Print output to STDOUT
M = int(raw_input())
A = set(map(int, raw_input().split()))
N = int(raw_input())
B = set(map(int, raw_input().split()))

l = sorted((A.difference(B)).union(B.difference(A)))

print "\n".join([str(element) for element in l])```

### Problem solution in pypy3 programming.

```# Enter your code here. Read input from STDIN. Print output to STDOUT
m = int(input())
set1 = set(list(map(int, input().split())))
n = int(input())
set2 = set(list(map(int, input().split())))
#print (set1)
#print (set2)

n1 = set1.difference(set2)
n2 = set2.difference(set1)
L = [str(x) for x in n1] + [str(x) for x in n2]
L.sort(key = int)
#print (L)
print ('\n'.join(L))```