Memory efficient doubly linked list
Doubly linked lists data structure are a type of linked lists that can be traversed in both directions, i.e. forward (head to the last node) and backward direction (last node...
Implementing Iterator pattern of a single linked list
This blog will describe both approaches (Manual and STL) for creating linked list iterator. Solving for finding iterator for linked list with different approaches will give a better understanding of...
Insert a node after the n-th node from the end
Introduction The linked list is one of the most important concepts and data structures to learn while preparing for interviews. Having a good grasp of Linked Lists can be a...
Make middle node the head in a linked list
In this blog, we will deep dive and discuss how to make the middle node head of a linked list. Making the middle node as the head node of the...
Reverse a stack without using extra space in O(n)
Problem Statement In this problem, we are given a stack. We have to reverse the stack without using extra space in O(n). Problem Statement Understanding As we know, reversing a...