mirror of
https://github.com/prdlk/leetcode.git
synced 2026-09-16 23:16:26 +00:00
18 lines
521 B
Plaintext
18 lines
521 B
Plaintext
---
|
|
title: 'Nodal Linear'
|
|
description: 'O(1) splice, no random access. Everything is pointer surgery.'
|
|
sidebar:
|
|
order: 1
|
|
label: Introduction
|
|
---
|
|
|
|
:::warning[Under construction]
|
|
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
|
:::
|
|
|
|
## Patterns
|
|
|
|
- [Linked List](/guides/coding/nodal-linear/linked-list) — Fast/slow runners, reversal, and dummy-head splicing cover it all.
|
|
|
|
**Systems anchor:** LRU cache = hashmap + doubly-linked list, the one hybrid that appears constantly.
|