AlgoDaily - Node Manipulation

Home > Data Structures and Algorithms 🚀 > Node Manipulation

Node Manipulation

Let's start playing with some pointers! Linked lists can be confusing to start, by we'll show you step by step how to master them.

Linked lists are a data structure that contain a sequence of items. They are very useful when you need to keep track of a group of objects and add or remove items from the middle of the list based on your needs.

In this section we'll cover:

What is a linked list?
How do they work?
What are their advantages and disadvantages?

Section Menu

How do I use this section?

1. LESSON

What Is the Linked List Data Structure?

In the world of software development, when it comes to organizing data, there are many tools that could do the job. The trick is to know which tool is the right one to use for our given purpose. As a reminder: regardless of which language we start coding in, one of the first things that we encounter are data structures, which we should be fam...

41 minutes Mark Completed

2. LESSON

Points On Slow and Fast Pointers

Objective: In this lesson, we'll cover the Floyd-Warshall Algorithm, and focus on these outcomes: You'll learn what slow and fast pointers are. We'll show you how to use this concept in programming interviews. You'll see how to utilize this concept in challenges. There are so...

59 minutes Mark Completed

3. LESSON

Circular Linked List vs. Doubly Linked List

In the wonderful world of computer science, linked lists play a fundamental role in organizing and storing data. These dynamic data structures consist of elements known as nodes, each linking to the next, forming a chain of connected elements. Imagine a treasure hunt, where every clue leads to the next. Now, *picture two spec...

43 minutes Mark Completed