Given two HashSet<string> objects setA and setB, how do you create a new HashSet containing only elements present in both sets?

hard🚀 Application Q9 of 15

C Sharp (C#) - Collections

Given two HashSet<string> objects setA and setB, how do you create a new HashSet containing only elements present in both sets?

Avar intersection = setA.Union(setB);

Bvar intersection = setA + setB;

var intersection = new HashSet<string>(setA);
intersection.IntersectWith(setB);

Dvar intersection = setA.Except(setB);

Step-by-Step Solution

Solution:

Step 1: Use IntersectWith to find common elements
Creating a new HashSet from setA and calling IntersectWith(setB) keeps only common elements.
Step 2: Check other options
var intersection = setA + setB; is invalid syntax, C returns union, D returns elements in setA not in setB.
Final Answer:
var intersection = new HashSet<string>(setA); intersection.IntersectWith(setB); -> Option C
Quick Check:
HashSet intersection = IntersectWith() method [OK]

Quick Trick: Use IntersectWith() to keep common elements in HashSet [OK]

Common Mistakes:

MISTAKES

Master "Collections" in C Sharp (C#)

9 interactive learning modes - each teaches the same concept differently

Want More Practice?

15+ quiz questions · All difficulty levels · Free

More C Sharp (C#) Quizzes