linked list - OpenGenus IQ: Computing Expertise & Legacy

Doubly Linked List in C++ using OOP and Template

In this article at OpenGenus, we will review how we can utilize OOP and templates to create a versatile and efficient implementation of a doubly linked list in C++.

Python

Circular Linked List in Python using OOP

In this article at OpenGenus, we will explore how to implement Circular Linked List in Python using OOP.

linked list

Implementing Linked list in Python using OOP concepts

In this article at OpenGenus, let's understand how to implement a Linked List in Python using OOP concepts.

JavaScript

Doubly linked list in JavaScript

In this article at OpenGenus, I will explain what are doubly linked lists and how to implement them using JavaScript.

Java

Implement Doubly Linked List in Java

In this article, we have explored the design of Doubly Linked List and implemented it in Java Programming Language using the concepts of Object Oriented Programming.

Algorithms

"Linked List Problems" book

This article introduces the exclusive book on Linked List Data Structure titled "Linked List Problems: For Interviews and Competitive Programming". It is a part of the book series "Must for Coding Interviews".

linked list

Linked List Interview Questions [with answers]

This is the list of Interview Questions based on Linked List Data Structure. You must practice these Multiple Choice Questions. This will help you master Linked List Coding Questions for Interviews at companies like Google and Microsoft.

Culture

Inventor of Linked List

Linked List is one of the most fundamental Data Structure and it was developed in 1953 by Hans Peter Luhn, Allen Newell, Cliff Shaw and Herbert Simon from IBM and RAND Corporation.

Data Structures

Circular Doubly Linked List

In this article, we have explored Circular Doubly Linked List and operations that can be performed on it. It is a combination to two Data Structures namely Circular Linked List and Doubly Linked List.

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.

Time Complexity

Time Complexity Analysis of Linked List

We have presented the Time Complexity analysis of different operations in Linked List. It clears several misconceptions such that Time Complexity to access i-th element takes O(1) time but in reality, it takes O(√N * N) time. We have presented space complexity of Linked List operations as well.

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.