Given the head pointer of a linked list, check if there’s a loop in the linked list. Proof of Floyd’s Cycle-Finding Algorithm.
Given the head pointers (head1 and head2) of two linked lists, find the intersection node of the two lists.
The C++ Standard Template Library (STL) is a powerful library of C++ template classes that provide general-purpose classes and functions. It has implementations of many popular and commonly used algorithms and data structures like vectors, linked-lists etc.
You are given a pointer to a node of a linked list which is to be deleted. You neither have a head pointer nor the pointer to the previous node.
A Linked List is a data structure in which the objects are arranged in a linear order. Unlike Arrays, you cannot access any element directly through its index.