# Challenge: Search in a Singly Linked List

Try to solve the Search in a Singly Linked List problem.

## We'll cover the following

## Statement

Given the `head`

of a singly linked list, search for a specific `value`

. If the `value`

is found, return TRUE; otherwise, return FALSE.

**Constraints:**

Let `n`

be the number of nodes in a linked list.

$0 \leq$ `n`

$\leq 500$ $-5000 \leq$ `Node.data`

,`value`

$\leq 5000$

## Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.