how can you find a circular loop in a linked list?
Sigiloso
we can use a flag once we visit that node, it raises the flag and it would be an indicator for next time visit this node is already visited or not else one can define bool variable to emphasize more efficiency in terms of memory and written a code for its implementation.