Algorithms Find starting point of loop in linked list In this article, we have explored three different algorithmic techniques to find starting point of loop in linked list.
Time Complexity Time and Space Complexity of Circular Linked List In this article, we have explored Time and Space Complexity of Circular Linked List. We have covered different cases like Worst Case, Average Case and Best Case.
Algorithms Quick Sort on Linked List In this article, we have explained how to implement Quick Sort on Linked List and if it is as efficient as Quick Sort on Array.
Algorithms Bubble Sort on Linked List In this article, we have presented the approach to implement Bubble Sort on Singly Linked List and Doubly Linked List along with implementations in C and C++.
Algorithms Swap Nodes in Pairs In this article, we have explained an efficient approach to Swap adjacent nodes in a Singly Linked List inplace. We have presented both Iterative and Recursive implementation.
Data Structures All O`one Data Structure In this post, we will design a Data Structure that returns the string occurring maximum and minimum times in constant time O(1). This will use a hashmap and a doubly linked list utilizing the advantages of each to solve the problem.
Algorithms Reverse part of Singly Linked List In this post, we have demonstrated ways in which we can not only reverse a singly linked list but also some part of Singly Linked List. It takes linear time O(N) to Reverse part of Singly Linked List.
Algorithms Remove N-th Node from end of Singly Linked List In this article, we have explained two approaches to Remove N-th Node from end of Singly Linked List. We can do this in single pass / one traversal in O(N) time.
Algorithms Merge K sorted Linked Lists We have explained 3 different algorithms to Merge K sorted Linked Lists such that the final Linked List is also sorted.
Algorithms Merge two sorted linked lists In this article, we will learn how to Merge two sorted linked list such that the final linked list is also sorted in linear time O(N).
Algorithms Fast and slow pointer technique in Linked List We have explained Fast and slow pointer technique in Linked List which is also known as tortoise and hare algorithm. It is used to efficiently solve several problems by using two pointers.
Algorithms Adding 2 integers as linked lists We will represent an Integer as Singly Linked List and define an addition algorithm to add two integers as Linked Lists. This is used to add very large integers which is not stored in existing data types.
Algorithms Array vs Linked List [Differences Explained] This article explain the differences between Array and Linked List (Array vs Linked List) in depth along with key points that will help you in deciding which one to use for a specific problem.
Algorithms Intersection point of two linked lists Given two linked lists, where the tail of the second list points to a node in the first list, find the node where both the lists intersect. We need to find the intersection point.
Algorithms Move the first element of the linked list to the end In this problem, given a linked list, we move the first element of the linked list to the end of the linked list.
Algorithms Delete Middle Node from Linked List In this problem, we will delete the Middle Node from a given Linked List. We have covered the algorithm (along with implementation) to delete the middle node from a Singly Linked List and Doubly Linked List.
Algorithms Move Last Element of Linked List to Front We will explore recursive and iterative algorithm to Move Last Element of Linked List to Front.
Algorithms Move all occurrences of an element to end of linked list In this problem, given a linked list and an input key value, the task is to move all occurrences of the given key to the end of the linked list.
Algorithms Applications of Linked list We have covered the applications of Linked List, Circular Linked List and Doubly Linked List. We start with the basics of Linked List and then, move to applications of the different types of Linked List.
Algorithms Linked List with no NULLs A Linked list is a dynamic data structure which can grow or shrink on demand. It is usually implemented using NULLs, we will consider an alternative no NULL approach and use placeholder nodes.
Algorithms Binary Search in a Linked List You are given a sorted singly linked list and a key (element to be searched), find the key in the linked list using binary search algorithm. The challenge is to find the middle element as Linked List does not support random access.
Algorithms Algorithm to detect and remove loop in a Linked List Given a Linked list, find out whether it contains a loop or not. If it does, then remove the loop and make the last node point to NULL.
Algorithms Algorithm to check if a linked list is sorted In this article, we have explored an algorithm to check if a given Linked List is sorted or not in linear time O(N). It takes constant space O(1).
Algorithms Check if Linked List is Empty Checking if the given Linked List is empty depends on the ways Linked List has been formed (with or without root). We have covered both approaches.
Algorithms Check whether a Singly Linked List is Palindrome or not Linked List can be palindrome if they have the same order when it traverse from forward as well as backward. This is solved using three methods: using stack, string and by reversing the list.