### What is symmetric difference:-

Symmetric difference of the two set is

Let the set M = {2, 6, 8, 12, 19, 23, 27, 54} and set N = {4, 5, 10, 24, 19, 27, 36, 49}

M-N = {2, 6, 8, 12, 23, 54} (If set N elements remove from set M and the remaining elements left in set M write it)

N-M = {4, 5, 10, 24, 36, 49} (If set M elements remove from set N and the remaining elements left in set N write it)

Therefore, MÎ”N = (M-N) U (N-M) = {2, 6, 8, 12, 23, 54} U {4, 5, 10, 24, 36, 49} = {2, 4, 5, 6, 8, 10, 12, 23, 24, 36, 49, 54}

Solution:-

#include<stdio.h>

int main()

{

int a[10],b[10],c[10],d[10],m=0,k=0,n=0,n1,n2,l,i,j,sy[100];

printf("Enter size of set A");

scanf("%d",&n1);

printf("Enter element of set");

for( i=0;i<n1;i++)

scanf("%d",&a[i]);

printf("Enter size of set B");

scanf("%d",&n2);

printf("Enter element of set");

for( i=0;i<n2;i++)

scanf("%d",&b[i]);

// logic for find A-B

for( i=0;i<n1;i++)

{

// here we check that is b[i] already present in the ans set

// if present then ignore it otherwise add it to the ans set

for(j=0;j<n2;j++)

{

if(b[j]==a[i])

break;

}

if(j==n2)

{

for(l=0;l<k;l++)

{

if(c[l]==a[i])

break;

}

if(l==k)

{

c[k]=a[i];

k++;

}

}

}

// logic for find B-A

for( i=0;i<n2;i++)

{

for(j=0;j<n1;j++)

{

if(b[i]==a[j])

break;

}

if(j==n1)

{

// here we check that is b[i] already present in the ans set

// if present then ignore it otherwise add it to the ans set

for(l=0;l<m;l++)

{

if(d[l]==b[i])

break;

}

if(l==m)

{

d[m]=b[i];

m++;

}

}

}

//logic for symmetric Difference

for(i=0;i<k;i++)

{

sy[n]=c[i];

n++;

}

for(i=0;i<m;i++)

{

sy[n]=d[i];

n++;

}

printf("\nsymmetric Difference of sets is:-\n");

for(i=0;i<n;i++)

printf("%d ",sy[i]);

return 0;

}

__Output:-__Enter size of set A 4

Enter element of set 3 2 4 5

Enter size of set B 4

Enter element of set 1 2 7 8

symmetric Difference of sets is: 3 4 5 1 7 8

__Recommended Post:__

__Companies interview:-__- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.

__Full C course:- __

__Key points:-__

- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.

__Cracking the coding interview:-__

__Array and string:-__

__Tree and graph:-__

__Hackerearth Problems:-__

- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Hackerrank Problems:-__- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution

__Data structure:-__

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__ MCQs:-__

## 3 Comments

Very helpful

ReplyDeleteexcellent

ReplyDeletevery very good but some explination also can be provided

ReplyDelete