How to iterate over elements of a LinkedList in reverse order without using the slow get(index) method?

You can use an iterator obtained with the descendingIterator() method.

import java.util.LinkedList;
import java.util.Iterator;

public class LinkedListBackwardIteration {

    public static void main(String[] args) {
        LinkedList<String> list = new LinkedList<>();
        list.add("Element 1");
        list.add("Element 2");
        list.add("Element 3");

        // Get an iterator for reverse traversal
        Iterator<String> descendingIterator = list.descendingIterator();

        // Iterate over elements in reverse order
        while (descendingIterator.hasNext()) {
            String element = descendingIterator.next();
            System.out.println(element);
        }
    }
}