Last Updated : 11 Jul, 2025
LinkedList<T>.Contains(T) method is used to check whether a value is in the LinkedList<T> or not. Syntax:
public bool Contains (T value);
Here, value is the value to locate in the LinkedList<T>. The value can be null for reference types. Return Value: This method returns True if value is found in the LinkedList, otherwise, False. Below given are some examples to understand the implementation in a better way: Example 1:
CSHARP
// C# code to check if a
// value is in LinkedList
using System;
using System.Collections;
using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a LinkedList of Strings
LinkedList<String> myList = new LinkedList<String>();
// Adding nodes in LinkedList
myList.AddLast("A");
myList.AddLast("B");
myList.AddLast("C");
myList.AddLast("D");
myList.AddLast("E");
// To check if a value is in LinkedList
Console.WriteLine(myList.Contains("B"));
}
}
Output:
True
Example 2:
CSHARP
// C# code to check if a
// value is in LinkedList
using System;
using System.Collections;
using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a LinkedList of Integers
LinkedList<int> myList = new LinkedList<int>();
// Adding nodes in LinkedList
myList.AddLast(1);
myList.AddLast(2);
myList.AddLast(3);
myList.AddLast(4);
myList.AddLast(5);
// To check if a value is in LinkedList
Console.WriteLine(myList.Contains(8));
}
}
Output:
False
Note: This method performs a linear search. Therefore, this method is an O(n) operation, where n is Count.
Space complexity: O(n) where n is size of the LinkedList
Reference:
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