Java | LinkedList

LinkedList is a List and Deque implementation built from linked nodes. It is appropriate when you need deque-style additions and removals at the ends, but it is rarely the best default for general indexed list use. Let the required operation choose the collection; do not choose by an imagined performance story without measuring the real workload.

Choose by Access Pattern

LinkedList does not provide fast random indexed access because it must traverse nodes. Prefer ArrayList for repeated get by index and use LinkedList when end-oriented deque operations express the problem better.

Use the Deque Contract

When a queue or stack-like behavior is needed, declare a Deque. Methods such as addLast, removeFirst and peekFirst make the direction and empty behavior easier to see.

Handle Empty Collections Intentionally

removeFirst throws when the deque is empty, while pollFirst returns null. Choose the method whose failure behavior matches whether emptiness is a programming error or a normal absence.

Avoid Premature Micro-Optimization

The best collection follows the actual operations and data size. A clean, correct ArrayList often outperforms a LinkedList for common iteration and index access despite simplified complexity folklore.

Worked Examples

Example 1: Use a LinkedList as a Deque

Deque makes the first and last operations explicit. The example enqueues in one direction and removes from the front, matching a simple FIFO queue contract.

Java

import java.util.Deque;
import java.util.LinkedList;

public class Main {
    public static void main(String[] args) {
        Deque<String> queue = new LinkedList<>();
        queue.addLast("first");
        queue.addLast("second");
        System.out.println(queue.removeFirst());
    }
}

Expected Result

first

Example 2: Poll When Emptiness Is Normal

pollFirst returns null instead of throwing when no element exists. That makes a no-work queue state a deliberate value the caller can inspect.

Java

import java.util.Deque;
import java.util.LinkedList;

Deque<String> queue = new LinkedList<>();
String next = queue.pollFirst();
System.out.println(next == null ? "empty" : next);

Expected Result

empty

Example 3: Name the Required Abstraction

The variable depends on Deque operations, not LinkedList-specific internals. The implementation remains replaceable if a different deque better fits the workload later.

Java

import java.util.ArrayDeque;
import java.util.Deque;

Deque<Integer> stack = new ArrayDeque<>();
stack.push(7);
System.out.println(stack.pop());

Expected Result

Build and Practice Plan

Build confidence by changing one rule at a time. Start with the normal case, make the expected value visible, then add the nearest boundary and a rejected input. Keep Java syntax in service of the contract: a program is useful only when its behavior remains understandable as inputs, scale and failure conditions change.

Step 1: create one normal case, one boundary case and one rejected or failure case for choose by access pattern before expanding the implementation.
Step 2: create one normal case, one boundary case and one rejected or failure case for use the deque contract before expanding the implementation.
Step 3: create one normal case, one boundary case and one rejected or failure case for handle empty collections intentionally before expanding the implementation.
Step 4: create one normal case, one boundary case and one rejected or failure case for avoid premature micro-optimization before expanding the implementation.

Design Review Questions

Before accepting a change, identify the valid values, the owner of mutable state, the behavior for missing or invalid input and the test that proves the important boundary. Keep I/O, storage and framework wiring outside the small Java rule until the local behavior is proven.

A clear result is better than a hidden side effect. Name the condition, return the calculation where possible and let the outer layer decide whether to print, store or transmit it.

Example 4: Make the input visible

Start by naming the value the next line depends on. This keeps the lesson input explicit before we apply a transformation or call an external boundary. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String lesson = "Java LinkedList";
        System.out.println(lesson.toUpperCase());
    }
}

Expected Result

JAVA LINKEDLIST

Try next: Replace the sample value with one from your own notes, predict the result, and then run it.

Example 5: Make the input visible

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String lesson = "Java LinkedList";
        System.out.println(lesson.toUpperCase());
    }
}

Expected Result

JAVA LINKEDLIST

Try next: Replace the sample value with one from your own notes, predict the result, and then run it.

Example 6: Make the input visible

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String lesson = "Java LinkedList";
        System.out.println(lesson.toUpperCase());
    }
}

Expected Result

JAVA LINKEDLIST

Try next: Replace the sample value with one from your own notes, predict the result, and then run it.

Example 7: Guard an empty boundary

A small guard makes the allowed and rejected path visible. We want a caller to receive an intentional result instead of discovering an unexplained failure later. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static boolean accepted(String value) {
        return value != null && !value.isBlank();
    }

    public static void main(String[] args) {
        System.out.println(accepted("Java LinkedList"));
    }
}

Expected Result

true

Try next: Try an empty value as well as the normal value and describe why the two outcomes differ.

Example 8: Keep the transformation pure

This step returns a value instead of mixing the rule with display or storage work. That separation gives us a small unit we can run, test, and reuse. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static int doubleValue(int value) { return value * 2; }

    public static void main(String[] args) {
        System.out.println(doubleValue(6));
    }
}

Expected Result

Try next: Call the same rule twice with different inputs and confirm that each result depends only on its input.

Example 9: Make a branch deliberate

Use a named branch where the business rule changes. A future reader should be able to point at the condition and state the result for both sides. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        int score = 7;
        String result = score >= 5 ? "ready" : "review";
        System.out.println(result);
    }
}

Expected Result

ready

Try next: Change the boundary value by one and explain exactly which branch becomes active.

Example 10: Use a collection without hidden mutation

Collections become safer when we can see which value is read, which value is derived, and whether the original collection remains owned by the caller. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

import java.util.List;

public class Main {
    public static void main(String[] args) {
        List<String> lessons = List.of("Java LinkedList", "boundary");
        System.out.println(String.join(" | ", lessons));
    }
}

Expected Result

Java LinkedList | boundary

Try next: Add one more item and predict the derived result before executing the code.

Example 11: Return a named outcome

A named outcome is easier to test than an implied side effect. We can now distinguish a successful path from a rejected path without guessing from console noise. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    record Outcome(String status, String lesson) {}

    public static void main(String[] args) {
        Outcome outcome = new Outcome("ready", "Java LinkedList");
        System.out.println(outcome.status());
    }
}

Expected Result

ready

Try next: Rename the outcome in your own words while preserving the same success and failure rule.

Example 12: Trace a small loop

Work through one value at a time. The point is not to memorize syntax; it is to see how the accumulator or output changes after each repeatable step. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        int total = 0;
        for (int value : new int[] {1, 2, 3}) total += value;
        System.out.println(total);
    }
}

Expected Result

Try next: Use a shorter collection first, then add one value and trace the extra iteration aloud.

Example 13: Keep display at the edge

The core rule prepares a value, while the outer line decides how to show it. That keeps the result usable by a UI, test, API, or command-line caller. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static String display(String value) { return "Lesson: " + value; }

    public static void main(String[] args) {
        System.out.println(display("Java LinkedList"));
    }
}

Expected Result

Lesson: Java LinkedList

Try next: Change only the display text and verify that the underlying rule and result stay unchanged.

Example 14: Test the closest boundary

A useful example includes the nearest boundary, not only the happy path. We are making the behavior inspectable before a real caller relies on it. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static int quantity(int value) {
        if (value < 1) throw new IllegalArgumentException("quantity must be positive");
        return value;
    }

    public static void main(String[] args) {
        System.out.println(quantity(1));
    }
}

Expected Result

Try next: Try the lowest supported value and then one value just outside the accepted range.

Example 15: Write a tiny regression check

A compact assertion turns the lesson into a repeatable promise. It helps us catch a changed rule before a larger program hides the source of the mistake. We are applying that habit while revisiting Java LinkedList .

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String result = "Java LinkedList".toUpperCase();
        if (!result.equals("JAVA LINKEDLIST")) throw new AssertionError("contract failed");
        System.out.println("contract holds");
    }
}

Expected Result

contract holds

Try next: Deliberately change the expected value once, observe the failed check, and then restore the correct contract.

Common Mistakes

Avoid: treating choose by access pattern as a syntax trick while leaving the domain rule, ownership or error behavior implicit.
Avoid: treating use the deque contract as a syntax trick while leaving the domain rule, ownership or error behavior implicit.
Avoid: treating handle empty collections intentionally as a syntax trick while leaving the domain rule, ownership or error behavior implicit.
Avoid: treating avoid premature micro-optimization as a syntax trick while leaving the domain rule, ownership or error behavior implicit.

Interview Checklist

State the input domain and the boundary value before explaining the syntax.
Explain the failure or rejected-input outcome rather than assuming the happy path.
Identify mutation, ownership and any value that must not be changed by a caller.
Name a focused test that would prove the rule still holds after a future change.
Separate the local Java decision from printing, persistence, networking or framework code.