Please enable JavaScript.

Coggle requires JavaScript to display documents.

Collection - Coggle Diagram

- - - - List<int> lst=new List()
        
        for add lst.Add(item int type) and for remove lst.Remove(item int type)
  - - - Dictionary<int, string> dict = new Dictionary<int, string>()
        
        dict.Add(1,"Muna") key and value and dict.Remove(1);
  - - - Queue<int> que = new Queue<int>()
        
        Same as non generic type only here we mention type
  - - - Stack<int> stk = new Stack<int>()
        
        Same as non generic type
  - - - HashSet<int> uniqueNumbers = new HashSet<int>();
        
        for add lst.Add(item int type) and for removelst.Remove(item int type)
        
        uniqueNumbers.Add(same value) duplicate value will be ignored
- - - - It can hold any data type(Object)
        
        ArrayList list = new ArrayList()
        
        Add,Remove,AddRange
  - - - HashTable accepts two items, one is key ,another is value. Both are object types
        
        Hashtable hashtable = new Hashtable()
        
        hashtable.Add(1,150); 1 is key and 150 is value
        
        hashtable.Remove(1); provide the key name you want to remove
        
        the generic version Dictionary<TKey, TValue> is recommended over the non-generic Hashtable
        
        ContainsKey check whether you key exist or not to read value we can use hashtable[key]
  - - - It can hold any data type(Object)
        
        Queue que = new Queue()
        
        que.Enqueue(50) add the value in the end of the queue
        
        que.Dequeue remove the value from the beginning of the enqueue
        
        que.Peek return the first item from the Queue
  - - - It can hold any data type(Object)
        
        Stack stk = new Stack()
        
        stk.Push(1) add value in the top or beginning
        
        stk.Pop() remove from the top
        
        stk.Peek() return the first item from stack