Here is an article I wrote on Linked Lists and goes through a LeetCode problem.
Recap, a linked list is a linear collection of nodes where each node points to the next node. Each node has a value property and a next property which references the next node in the list.
This is what makes linked lists a linear data structure. There is a sequence and an order to the list. To get to the end of the list, we must start at the first node (head) and go through all of the nodes in order. The final node (tail) will point to null, indicating that is the end of the list.
You are given the head of a linked list, and an integer k.
Return the head of the linked list after swapping the values of the kth node from the beginning and the kth node from the end (the list is 1-indexed).
Input: head = [1,2,3,4,5], k = 2 Output: [1,4,3,2,5]
Linked List in Data Structure. In computer science, we refer to the format of storing data on storage devices as a data structure. An array is the collection of data stored in contiguous memory locations.
Continuing on the Quick Revision of Important Questions for My Interviews. These Are Good Puzzles or Questions Related to Data Structures. Let's explore it with us now.
This video is based on Array vs Linked List in Data Structure. This tutorial will help beginners to learn more about Arrays and Linked lists in Data Structure and all the basic differences between Arrays and Linked List. The video will include a graphical representation of both the data structures for a better learning experience.
Your Data Architecture: Simple Best Practices for Your Data Strategy. Don't miss this helpful article.
This video is based on Singly Linked list in Data Structure. This Singly linked list tutorial will help the beginners with the major fundamentals of Singly linked list, its implementation and the operations involved in Singly linked list. The video also covers practical demo for a better learning experience.