Skip to main content

Courses About Pricing Educators

Sign in Get started

Courses About Pricing Educators

Get started Sign in

Loading courses

Loading lessons

Linked Lists: Data Structures and Algorithms: Uncharted

Courses Data Structures and AlgorithmsLinked Lists

Linked ListsPro

Build chains from nodes, then traverse and restructure them with pointers.

Data Structures and Algorithms
Unit 4 of 16
20 lessons
130 min
420 XP

This unit is part of Pro. Upgrade to open every lesson in it.

Lessons

20 total

1Train Cars, Not ShelvesContrast linked-node traversal and local relinking with an array's direct indexing and shifting.ProInteractiveConcept6 min20 XPOpen
2Node and NextApply explicit node-and-next linking to linking three nodes by hand and walking the chain.ProCodeConcept6 min20 XPOpen
3Build an AppendApply LinkedList append and to-array bridge to building LinkedList append and to-array operations.ProCodeConcept6 min20 XPOpen
4Prepend Is InstantApply constant-work head insertion to inserting at the head with one pointer update.ProCodeConcept6 min20 XPOpen
5Walk the ChainApply single-chain traversal queries to computing length and membership through traversal.ProCodeConcept6 min20 XPOpen
6Insert Mid-ChainApply two-link middle insertion to re-coupling two links in the safe order.ProCodeConcept6 min20 XPOpen
7Unlink a CarApply previous-pointer deletion to deleting with current and previous pointers.ProCodeConcept6 min20 XPOpen
8Predict the LinksDetermine linked-list reachability after insertion and deletion by following next references from the head.ProInteractiveConcept6 min20 XPOpen
9Reverse the ChainApply iterative previous-current-next reversal to reversing every next link with three pointers.ProCodeConcept6 min20 XPOpen
10Tortoise and HareApply fast-and-slow midpoint traversal to finding the midpoint with fast and slow pointers.ProCodeConcept6 min20 XPOpen
11The Loop DetectorApply Floyd fast-and-slow cycle detection to detecting a chain that reconnects to an earlier node.ProCodeConcept6 min20 XPOpen
12Merge Two ChainsApply dummy-head sorted-list merge to merging two sorted linked chains.ProCodePractice8 min20 XPOpen
13Nth from the EndApply fixed-gap two-pointer scan to maintaining a fixed pointer gap.ProCodeConcept6 min20 XPOpen
14Doubly LinkedApply bidirectional prev-and-next linking to walking prev and next links like back and forward buttons.ProCodeConcept6 min20 XPOpen
15Arrays vs ChainsCompare arrays and linked lists by access, relocation, and position-finding costs.ProInteractiveConcept6 min20 XPOpen
16Move to FrontApply find-unlink-prepend restructuring to moving a recently played node to the head.ProCodePractice8 min20 XPOpen
17Chain with a TailApply constant-work tail-pointer append to making append constant-work with a tail pointer.ProCodeConcept6 min20 XPOpen
18Palindrome ChainApply midpoint, reverse-half, compare composite to combining midpoint, reverse-half, and comparison.ProCodePractice8 min20 XPOpen
19Where Chains WinChoose arrays or linked lists for concrete workloads while accounting for the cost of locating a node.ProInteractiveConcept6 min20 XPOpen
20Linked Lists Mastery CheckApply append, reverse, and fast-slow synthesis to combining append, midpoint, and reversal.ProCodeMastery check10 min40 XPOpen

Hashing Stacks and Queues