mirror of
https://github.com/prdlk/leetcode.git
synced 2026-11-03 13:27:36 +00:00
17 lines
521 B
Plaintext
17 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.
|