Singly Linked List Cycle Check in Python
Given a singly linked list, write a function which takes in the first node in a singly linked list and returns a boolean indicating if the linked list contains a "cycle".
Data Structure
Implementation of Doubly Linked List in Python
In Doubly Linked List, We declare two pointers to store location of next Node and previous Node.
Understand Doubly Linked List Data Structure
In a doubly linked list, we define a linked list in which each node keeps an explicit reference to the node before it and a reference to the node after it.
8 common data structures every programmer must know
Data structure is a way of data organization, management, and storage format that enables efficient access and modification.
Implementation of Singly Linked List in Python
In a singly linked list, we have an ordered list of items as individual Nodes that have pointers to other Nodes.
Understand The Singly Linked List and its Operation
A singly linked list, in its simplest form, is a collection of nodes that collectively form a linear sequence. Each node stores a reference to an object that is an element of the sequence, as well as a reference to the next node of the list.
Understand Big-O Notation Complexity Of Algorithm
Big-O notation is a relative representation of the complexity of an algorithm.
Implementation of Deques in Python
A deque, also known as a double-ended queue, is an ordered collection of items similar to the queue. It has two ends, a front, and rear, and the items remain positioned in the collection.
Implementation of Queue in Python
A queue is an ordered collection of items where the addition of new items happens at one end, called the “rear,” and the removal of existing items occurs at the other end, commonly called the “front.”
Implementation of Stack in Python
A stack is an ordered collection of items where the addition of new items and the removal of existing items always takes place at the same end.