Skip to content
CodeWiki
Practice
Paths
Tracks
Cheatsheets
Playground
Glossary
AI era
Search
⌘K
English
English
Chinese
Practice
Paths
Tracks
Cheatsheets
Playground
Glossary
AI era
English
English
Chinese
Practice
/
Quiz
/
CS foundations
/
CS foundations
When is insertion into a linked list genuinely constant-time?
from CS foundations
advanced
1 min
When is insertion into a linked list genuinely constant-time?
When the caller already holds the node or link at the insertion position.
Whenever the list is singly linked, regardless of how the position is found.
Only after copying the list into an array.
Check
Ask AI about this kata
Report an error
previous kata
Give the asymptotic time for indexed access to an array element
Fill in
next kata
Name the traversal that finds a minimum-edge path in an unweighted graph
Fill in
A new version is available
Reload