A modern programming language that makes developers happier.

kotlinlang

`LinkedList` *can't be more efficient* under any circumstances

If you're constantly adding an removing stuff on the front of the list a `LinkedList` can definitely be faster.

You are changing few references instead of moving the elements in the array a step forward?

ArrayQueue can do this without bloating and fragmenting heap.

Exactly, usually you can find better data structure for any use case than LinkedList

Ah and what about `iterator.remove()` and `.add()`? I don't think `ArrayDeque` is good at those either.

Nope, but it really depends on case.  And cases when LinkedList is the best choice on practice (not in theory) are very limited 

Copying several hundreds of values inside CPU cache may be faster, than a single `iterator.next()` which requires loading another block of RAM.