Web Technologies37.4K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Arrays6.5K+ articles

Competitive Programming3.3K+ articles

Strings3.3K+ articles

Greedy2.1K+ articles

Algorithms2.0K+ articles

Sorting1.8K+ articles

Searching1.7K+ articles

A singly linked list is a data structure that consists of nodes, where each node contains two parts: a data field that holds the actual value and a pointer that points to ...read more

Linked List

DSA

Given a Doubly Linked List, the task is to insert a new node at the beginning/start/front of the linked list.Examples:Input: Linked List = 2 - 3 - 4 - NULL , New Node = 1...read more

Linked List

DSA

doubly linked list

Given aDoubly Linked List, the task is to insert a new node after a given nodein the linked list.Examples: Input: Linked List = 1 - 2 - 4, newData = 3, key = 2Output: Link...read more

Linked List

DSA

doubly linked list

Given a Doubly Linked List, the task is to insert a new node before a given node in the linked list.Examples: Input: Linked List = 1 - 3 - 4, newData = 2, key = 3Output: L...read more

Linked List

DSA

doubly linked list

Given a Doubly Linked List, the task is to insert a new node at a specific position in the linked list.Examples:Input: Linked List = 1 - 2 - 4, newData = 3, position = 3Ou...read more

Linked List

DSA

doubly linked list

Given aDoubly Linked List, the task is to insert a new node at the end of the linked list.Examples: Input: Linked List = 1 - 2 - 3, NewNode = 4Output: Linked List = 1 - 2 ...read more

Linked List

DSA

doubly linked list

A circular linked list is a type of data structure where each node points to the next one, and the last node connects back to the first, forming a circle. This setup allow...read more

Linked List

Data Structures

DSA

circular linked list

A circular linked list is a special type of data structure where each node points to the next, and the last node connects back to the first, forming a loop. This design al...read more

Linked List

Data Structures

DSA

circular linked list

A circular linked list is a data structure where each node points to the next, and the last node connects back to the first, creating a loop. Insertion at the end in circu...read more

Linked List

Data Structures

DSA

circular linked list

Traversal of Doubly Linked List is one of the fundamental operations, where we traverse or visit each node of the linked list. In this article, we will cover how to traver...read more

Linked List

DSA

doubly linked list

Given a doubly linked list, the task is to delete the node from the beginning of the linked list.Examples: Input : 1 - 2 - 3 - NULLOutput : 2 - 3 - NULLInput : 2 - 4 - 6 -...read more

Linked List

DSA

doubly linked list

Given a doubly linked list, the task is to delete the last node of the given linked list.Examples:Input:1 - 2 - 3 - NULLOutput:1 - 2 - NULLExplanation:The last node of the...read more

Linked List

DSA

doubly linked list

Given two sorted linked lists consisting of N and Mnodes respectively. The task is to merge both of the lists (in place) and return the head of the merged list.Examples:In...read more

Linked List

DSA

Given a Singly Linked List, the task is to print all the elements in the list.Examples:Input: 1-2-3-4-5-nullOutput: 1 2 3 4 5Explanation: Every element of each node from h...read more

Linked List

DSA

Linked Lists

Unlike arrays, which are stored in contiguous memory locations, linked lists consist of nodes, where each node contains data and a reference (or link) to the next node in ...read more

Linked List

DSA

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy PolicyGot It !