Reach for a linked list when you reshape more than you index. If you constantly insert and remove at points you already hold, its O(1) splicing wins. Queues, playlists, and edit histories fit this shape.
It also helps when size is unpredictable. A linked list grows one node at a time, with no big block to reserve or copy. You never pay a resize that duplicates the whole collection.
Skip it when you need fast access by position. Arrays give O(1) indexing and pack tightly in memory, which the processor loves. If you mostly read by index, an array almost always wins.
Rewriting in plainer words…
This answer doesn't lend itself to a diagram - it reads best . No credits were charged.
