Everything has its uses, for example linked lists are quite nice for stuff like euler circles, and also linked list is very simple and cool to implement on your own

Then implement LRU cache without linked list in O(1) complexity

While they are not super useful, I would definitely agree that they are underrated.

One nice trick is to combine them with maps to iterators std::map<T, std::list<T>::iterator>, in this way you can get benefits of both map and list. Example: 110657402 (although I don't understand this solution anymore so I am not sure whether that was really necessary).

bfs with list is delicious

list q = {0};
for(int v : q) for(int i : g[v]) if(d[i] == -1) {
	q.push(i);
	d[i] = d[v] + 1;
}

its actually just a splay tree/rb tree/skip list/any dynamic O(logN) data structure with strings in fact