Arrays: Operations, Complexity, and Two-Pointer TechniqueDynamic Programming: Memoisation and the Fibonacci Problem
Computer ScienceData Structures & Algorithms
Linked Lists: Singly, Doubly, and Circular
1,876 views 1h 3m February 22, 2024
Overview
A complete treatment of linked list data structures — implementation, traversal, reversal, and detecting cycles. Includes Floyd's cycle detection algorithm.
Key Concepts
- Node structure and pointer manipulation
- Singly vs. doubly vs. circular lists
- Reversing a linked list
- Floyd's cycle detection
Resources
Linked ListsFloyd's AlgorithmDSA