Last Updated : 11 Jul, 2025
A
HashSetis an unordered collection of the
unique elements. It comes under
System.Collections.Genericnamespace. It is used in a situation where we want to prevent duplicates from being inserted in the collection. As far as performance is concerned, it is better in comparison to the list. Elements can be added to
HashSetusing
HashSet .Add(T) Method.
Syntax:mySet.Add(T item);
Here
mySetis the name of the HashSet.
Parameter:item: The element to add to the set.Return Type:
This method returns
trueif the element is added to the
HashSet object. If the element is already present then it returns
false. Below given are some examples to understand the implementation in a better way:
Example 1: CSHARP
// C# code to add element to HashSet
using System;
using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a HashSet of odd numbers
HashSet<int> odd = new HashSet<int>();
// Inserting elements in HashSet
for (int i = 0; i < 5; i++) {
odd.Add(2 * i + 1);
}
// Displaying the elements in the HashSet
foreach(int i in odd)
{
Console.WriteLine(i);
}
}
}
Example 2: CSHARP
// C# code to add element to HashSet
using System;
using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a HashSet of strings
HashSet<string> mySet = new HashSet<string>();
// Inserting elements in HashSet
mySet.Add("Geeks");
mySet.Add("GeeksforGeeks");
mySet.Add("GeeksClasses");
mySet.Add("GeeksQuiz");
// Displaying the elements in the HashSet
foreach(string i in mySet)
{
Console.WriteLine(i);
}
}
}
Output:
Geeks GeeksforGeeks GeeksClasses GeeksQuizReference:
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4