लोड हो रहा है...

HashSet

new HashSet<string>() se tags naam ka HashSet<string> banaiye. "oak" add kijiye, phir "pine", phir dubara "oak". tags.Count likhiye. Kaam Pine me Main ke sath rakhein. using System; ke neeche using System.Collections.Generic; rakhein. dotnet run se chalaiye. Screen par ek line 2 honi chahiye. Set sirf unique values rakhta hai. Wahi shabd ka dusra Add Count badhata nahi. Is page par pehle wala check tags.Contains("pine") ko True print karta hai. Shuru wali public class ka naam Pine rakhein.

Unique values, keyed pairs nahi

Dictionary page par aapne bin me keys ke niche pairs rakhe. HashSet sirf values rakhta hai. Har entry ke liye doosra int type nahi. Ek shabd ek baar add hota hai. Dubara add karne se size nahi badhta. Set ko tags ka dher samjhiye: wahi tag do baar girne par bhi ek tag rehta hai. tags naam wahi set hai jo aap is page par rakhte hain.
Pine file kholiye. Shuru naam Pine hi rehta hai. Dictionary<string, int> bin ke leftovers jo bin["oak"] aur bin.Count print karte hain hata dijiye. List ke Remove leftovers hata dijiye. Har ReadLine hata dijiye. Saaf Main se ek-line Count screen bharosa banati hai.
Upar using System; aur using System.Collections.Generic; rakhein. Main ke andar likhein HashSet<string> tags = new HashSet<string>();. Phir tags.Add("oak");, tags.Add("pine");, aur phir tags.Add("oak");. Console.WriteLine(tags.Count); likhein. Chalane se pehle save karein. Duplicate Add ke baad wala Count yahi rakhi hui demo hai. Alag chhoti file pehle Contains check karti hai; rakha jawab ab bhi 2 hai.
HashSet ko ek type argument chahiye: value ka type. Yahan <string> hai. Seekhne wali file me bina angle wala HashSet tags mat likhein.

Count after duplicate Add

csharp
using System;
using System.Collections.Generic;

public class Pine
{
    public static void Main()
    {
        HashSet<string> tags = new HashSet<string>();
        tags.Add("oak");
        tags.Add("pine");
        tags.Add("oak");
        Console.WriteLine(tags.Count);
    }
}

Pine Count demo se pehle Contains puchta hai

Main me do alag Add ke baad aap puch sakte hain value maujood hai ya nahi. tags.Add("oak"); phir tags.Add("pine");, phir tags.Contains("pine"); likhein. Woh chhoti file checkpoint hai. Quiz ka jawab ab bhi Count wali file hai jo duplicate Add ke baad 2 print karti hai.

Contains after two Adds

csharp
using System;
using System.Collections.Generic;

public class Pine
{
    public static void Main()
    {
        HashSet<string> tags = new HashSet<string>();
        tags.Add("oak");
        tags.Add("pine");
        Console.WriteLine(tags.Contains("pine"));
    }
}

Rakhi hui Count file upar se padhiye. using System; console names taiyar karta hai. using System.Collections.Generic; HashSet taiyar karta hai. public class Pine starter hai. public static void Main() jahan runtime shuru hota hai. new HashSet<string>() khali set banata hai. Pehla Add "oak" rakhta hai. Doosra "pine". Teesra Add("oak") dekhta hai oak pehle se hai, isliye Count 2 rehta hai. tags.Count likhne se 2 print hota hai.
dotnet run se chalaiye. Program ek line likh kar rukta hai. Agar type ka intezar kare to file me ReadLine bacha hai — hata dijiye. Screen 2 dikhati hai. Agar 3 dikhe to shayad List use hua HashSet ki jagah — HashSet<string> par wapas jaiye. Agar 3 phir 2 dikhe to dictionary demo chal raha ho sakta hai. Build HashSet na dhunde to using System.Collections.Generic; wapas rakhein.
Agar tags[0] list slot ke liye likhein to build fail — set me List jaisa indexer nahi. Add, Contains, Count par rahein. Kisi Add se pehle Contains("oak") chalayein to screen False dikhati hai.

Add, Contains aur Count saath me

Add nayi value tab rakhta hai jab woh nayi ho. Contains maujoodgi par True ya False deta hai. Count batata hai ab set me kitni alag values hain. Teeno ek hi HashSet<string> tags par new HashSet<string>() se kaam karte hain.
Jo bin["oak"] aur bin.Count print kare woh dictionary page hai. Yahan HashSet<string> tags aur unique Add ki aadat rakhein. Main me dictionary milane se set Count ki jagah keyed int print ho sakta hai.

📊 Add Contains Count

Call Is page par ye kya batata hai
tags.Add("oak") oak tab store karta hai jab pehle se na ho
tags.Contains("pine") kya pine maujood hai (True / False)
tags.Count ab set me kitni alag values hain

iterating ke liye kya bachta hai

Yeh page set banata hai, unique values add karta hai, Contains puchta hai, Count padhta hai. Agla page — iterating — loop se collection ki values ek ek karke chalta hai. Yahan create, Add, Contains, Count par rahein. Saare set methods ek saath mat sochiye; lesson ka lakshya unique tags bag hi hai. Jab dotnet run Count file se 2 print kare to is page ka checkpoint mil gaya.
Doosra Main nested mat banaiye. File me Dictionary indexer demos mat chhodiye. Agar sirf True dikhe to aap Contains file par hain — 2 ke liye Count file chalaiye. Teen Add me duplicate ke baad Count 3 ho to HashSet par nahi hain — type aur using check karein. Set par <string> rakhein.

Aap HashSet<string> tags = new HashSet<string>(); likh sakte hain, tags.Add("oak");, tags.Add("pine");, dubara tags.Add("oak"); chala sakte hain, phir tags.Count likhein. dotnet run se chalaiye. Screen 2 dikhati hai. Duplicate ne set bada nahi kiya. Pehle check me Contains("pine") True tha. HashSet ko unique tags ke dher jaisa sochein. Jab key se joda value chahiye tab Dictionary; jab sirf ek baar maujood hona matter kare tab set. Pine wahi darwaza hai jo dotnet run se kholte hain. Agla page iterating hai.
using System.Collections.Generic; rakhein. Set type par <string> rakhein. Main se dictionary demos hata dein taaki screen galti se 3 phir 2 na dikhaye. Ye aadatein iterating se pehle checkpoint hain.

🧠 अपने ज्ञान की परीक्षा करें

शुरू करने के लिए तैयार

अपने ज्ञान की परीक्षा करें

इस इंटरैक्टिव क्विज़ के साथ अपनी चुनौती लें और देखें कि आप विषय को कितनी अच्छी तरह समझते हैं

❓
6
प्रश्न
🎯
70%
पास करने के लिए
♾️
∞
समय
🔄
∞
प्रयास

📝 निर्देश

  • हर प्रश्न को ध्यान से पढ़ें
  • हर प्रश्न के लिए सबसे अच्छा उत्तर चुनें
  • आप जितनी बार चाहें क्विज़ दोबारा दे सकते हैं
  • आपकी प्रगति शीर्ष पर दिखाई जाएगी