Set operations help you combine or compare groups of items easily. They let you find common items, all items, or items only in one group.
Set operations (Union, Intersect, Except) in C Sharp (C#)
var union = set1.Union(set2); var intersect = set1.Intersect(set2); var except = set1.Except(set2);
These methods return a new collection without changing the original sets.
They work on any collections that implement IEnumerable<T>.
var set1 = new List<int> {1, 2, 3}; var set2 = new List<int> {3, 4, 5}; var union = set1.Union(set2);
var intersect = set1.Intersect(set2);
var except = set1.Except(set2);
This program shows how to use Union, Intersect, and Except with two lists of fruits.
using System; using System.Collections.Generic; using System.Linq; class Program { static void Main() { var set1 = new List<string> {"apple", "banana", "cherry"}; var set2 = new List<string> {"banana", "date", "fig"}; var union = set1.Union(set2); var intersect = set1.Intersect(set2); var except = set1.Except(set2); Console.WriteLine("Union: " + string.Join(", ", union)); Console.WriteLine("Intersect: " + string.Join(", ", intersect)); Console.WriteLine("Except: " + string.Join(", ", except)); } }
Set operations do not change the original lists; they create new results.
Order of items in the result may not be guaranteed.
Use these operations to simplify comparing and combining collections.
Union combines all unique items from two collections.
Intersect finds items common to both collections.
Except finds items in the first collection but not in the second.
Practice
Which set operation in C# returns all unique elements from two collections combined?
Solution
Step 1: Understand the meaning of Union
Union combines all unique elements from both collections without duplicates.Step 2: Compare with other operations
Intersect returns only common elements, Except returns elements only in the first collection, and Concat just joins collections without removing duplicates.Final Answer:
Union -> Option AQuick Check:
Union = all unique elements combined [OK]
- Confusing Union with Intersect
- Thinking Concat removes duplicates
- Mixing Except with Union
Which of the following is the correct syntax to get the intersection of two sets setA and setB in C#?
var result = ???;
Solution
Step 1: Identify method for intersection
The Intersect method returns elements common to both collections.Step 2: Verify syntax correctness
setA.Intersect(setB) is the correct syntax; Union and Except do different operations, and Join is unrelated.Final Answer:
setA.Intersect(setB) -> Option BQuick Check:
Intersect = common elements [OK]
- Using Union instead of Intersect
- Trying to use Join for sets
- Incorrect method call syntax
What is the output of the following C# code?
var setA = new HashSet<int>() {1, 2, 3, 4};
var setB = new HashSet<int>() {3, 4, 5, 6};
var result = setA.Except(setB);
Console.WriteLine(string.Join(",", result));Solution
Step 1: Understand Except operation
Except returns elements in the first set that are not in the second set.Step 2: Apply Except to given sets
setA has 1,2,3,4; setB has 3,4,5,6; elements in setA but not in setB are 1 and 2.Final Answer:
1,2 -> Option DQuick Check:
Except = elements only in first set [OK]
- Confusing Except with Intersect
- Including elements from second set
- Expecting all unique elements combined
Find the error in this C# code snippet that tries to get the union of two sets set1 and set2:
var set1 = new HashSet<string>() {"apple", "banana"};
var set2 = new HashSet<string>() {"banana", "cherry"};
var result = set1.Union(set2).ToList();
Console.WriteLine(result);Solution
Step 1: Check method usage
Union exists and works on HashSet; ToList() is valid after Union.Step 2: Identify Console.WriteLine issue
Console.WriteLine cannot print a List directly; it prints the type name instead.Final Answer:
Console.WriteLine cannot print a List directly -> Option CQuick Check:
Printing List needs string.Join or loop [OK]
- Assuming Union is invalid for HashSet
- Calling ToList before Union
- Thinking HashSet can't hold strings
You have two lists of integers representing IDs: list1 = {1, 2, 3, 4, 5} and list2 = {4, 5, 6, 7}. You want to find IDs that are either in list1 or list2 but not in both (exclusive or). Which C# code snippet correctly achieves this using set operations?
Solution
Step 1: Understand exclusive or (XOR) logic
XOR means elements in one set or the other but not both.Step 2: Analyze each option
var result = list1.Union(list2).Except(list1.Except(list2)); subtracts elements unique to list1 from the union, leaving common and list2-unique elements - incorrect. var result = list1.Except(list2).Union(list2.Except(list1)); combines elements unique to each list using Except and Union, which directly matches XOR.Final Answer:
var result = list1.Except(list2).Union(list2.Except(list1)); -> Option AQuick Check:
XOR = unique elements from each set combined [OK]
- Using Intersect instead of Except for uniqueness
- Confusing union and intersection order
- Trying to intersect except results
Ready to prove it?
Pass the test and this pattern moves unknown
