A stack is a linear data structure that works on the principle of LIFO. LIFO stands for Last In First Out. This means that the last elements which is going to get inserted is going to be the first element to get removed. We can imagine a stack as a pile of cloths or a … Read more
When we have a singly linked list, the task is to update the linked list by adding a new node in the middle of the linked list. If the size of the linked list, size is even, then the new node is to be added at (size/2) position or else if the length is odd … Read more
When we have a linked list, we want to add a node in the end of a linked list. Let us first try to figure out the intuition behind the algorithm. We start by iterating the list so that we get to the last node of the linked list. Next, we add the new node … Read more
When we have a linked list we might need to add/ insert a node in the beginning of a linked list. If you want to know more about what is a linked list, check out a detailed guide on linked list here. Here, in this tutorial, let us try to insert a node in the … Read more
List Data Structure is mostly similar to the arrays data structure but with few tweaks and upgrades. List is an abstract data type where the stored data can be both homogenous and heterogeneous in an ordered sequence. These are sometimes referred to as sequences as well. Unlike arrays, lists do not require any pre-definition of … Read more
Analyzing an algorithm is very important when building a large scale software system. Engineers work on to write the most optimal code in terms of efficiency when writing the code. Big O notation is a standardised way to analyze the efficiency of algorithms in terms of Worst Case Scenario or the Upper Bound with respect … Read more
