C# | Check if an element is in the Queue Last Updated : 01 Feb, 2019 Comments Improve Suggest changes Like Article Like Report Queue represents a first-in, first out collection of object. It is used when you need a first-in, first-out access of items. When you add an item in the list, it is called enqueue, and when you remove an item, it is called deque. Queue.Contains(T) Method is used to check whether an element is in the Queue. Properties: Enqueue adds an element to the end of the Queue. Dequeue removes the oldest element from the start of the Queue. Peek returns the oldest element that is at the start of the Queue but does not remove it from the Queue. The capacity of a Queue is the number of elements the Queue can hold. As elements are added to a Queue, the capacity is automatically increased as required by reallocating the internal array. Queue accepts null as a valid value for reference types and allows duplicate elements. Syntax: public virtual bool Contains(object obj); Return Value: The function returns True if the element exists in the Queue and returns False if the element doesn't exist in the Queue. Below given are some examples to understand the implementation in a better way: Example 1: CSHARP // C# code to Check if a Queue // contains an element using System; using System.Collections.Generic; class GFG { // Driver code public static void Main() { // Creating a Queue of Integers Queue<int> myQueue = new Queue<int>(); // Inserting the elements into the Queue myQueue.Enqueue(5); myQueue.Enqueue(10); myQueue.Enqueue(15); myQueue.Enqueue(20); myQueue.Enqueue(25); // Checking whether the element is // present in the Queue or not // The function returns True if the // element is present in the Queue, else // returns False Console.WriteLine(myQueue.Contains(7)); } } Output: False Example 2: CSHARP // C# code to Check if a Queue // contains an element using System; using System.Collections.Generic; class GFG { // Driver code public static void Main() { // Creating a Queue of strings Queue<string> myQueue = new Queue<string>(); // Inserting the elements into the Queue myQueue.Enqueue("Geeks"); myQueue.Enqueue("Geeks Classes"); myQueue.Enqueue("Noida"); myQueue.Enqueue("Data Structures"); myQueue.Enqueue("GeeksforGeeks"); // Checking whether the element is // present in the Queue or not // The function returns True if the // element is present in the Queue, else // returns False Console.WriteLine(myQueue.Contains("GeeksforGeeks")); } } Output: True Reference: https://docs.microsoft.com/en-us/dotnet/api/system.collections.generic.queue-1.contains?view=netframework-4.7.2 Comment More infoAdvertise with us Next Article C# | Check if an element is in the Queue S Sahil_Bansall Follow Improve Article Tags : Misc C# CSharp-method CSharp-Generic-Queue CSharp-Collections-Namespace CSharp-Generic-Namespace +2 More Practice Tags : Misc Similar Reads Check if X can give change to every person in the Queue Given an array of N integers where Ai denotes the currency of note that the i-th person has. The possible currencies are 5, 10, and 20. All the N people are standing in a queue waiting to buy an ice cream from X which costs Rs 5. Initially, X has an initial balance of 0. Check if X will be able to p 7 min read C# | Check if a Stack contains an element Stack represents a last-in, first out collection of object. Stack<T>.Contains(Object) Method is used to check whether an element is in the Stack<T> or not. Syntax: public virtual bool Contains(object obj); Return Value: The function returns True if the element exists in the Stack<T 2 min read Copying the Queue elements to 1-D Array in C# Queue<T>.CopyTo(T[], Int32) Method is used to copy the Queue elements to an existing one-dimensional Array, starting at the specified array index. The elements are copied to the Array in the same order in which the enumerator iterates through the Queue and this method is an O(n) operation, whe 4 min read C# | Get the number of elements contained in the Queue Queue represents a first-in, first out collection of object. It is used when you need a first-in, first-out access of items. When you add an item in the list, it is called enqueue, and when you remove an item, it is called deque. Queue.Count Property is used to get the number of elements contained i 2 min read How to create a Queue in C# Queue() Constructor is used to initializes a new instance of the Queue class which will be empty, and will have the default initial capacity, and uses the default growth factor. Queue represents a first-in, first out collection of object. It is used when you need first-in, first-out access of items. 2 min read queue::front() and queue::back() in C++ STL Queue are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the front. queue::front() This function is used to reference the first or the oldest element of the queue container. This function can 3 min read queue::empty() and queue::size() in C++ STL Queue is a type of container adaptor that operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the front. queue::empty() empty() function is used to check if the queue container is empty or not. SyntaxqueueName.empty()ParametersThis 4 min read C# | Add an object to the end of the Queue - Enqueue Operation Queue represents a first-in, first out collection of object. It is used when you need a first-in, first-out access of items. When you add an item in the list, it is called enqueue, and when you remove an item, it is called dequeue. Queue<T>.Enqueue(T) Method is used to add an object to the end 3 min read Getting an object at the beginning of the Queue in C# The Dequeue() method is used to returns the object at the beginning of the Queue. This method is similar to the Peek() Method. The only difference between Dequeue and Peek method is that Peek() method will not modify the Queue but Dequeue will modify. This method is an O(1) operation and comes under 2 min read queue::emplace() in C++ STL Queue is also an abstract data type or a linear data structure, which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). In a FIFO data structure, the first element added to the queue will be the first one to be removed. queue::emplace() This fu 3 min read Like