Linked list in Java
Node structure
class ListNode {
int val;
ListNode next;
ListNode(int val) { this.val = val; }
}Common Java questions
- Reverse Linked List
- Middle of the Linked List
- Remove Nth Node from End
- Merge Two Sorted Lists
- Detect Cycle
- Intersection of Two Linked Lists
Pattern: reverse linked list
ListNode reverseList(ListNode head) {
ListNode prev = null;
ListNode curr = head;
while (curr != null) {
ListNode next = curr.next;
curr.next = prev;
prev = curr;
curr = next;
}
return prev;
}Interview guidance
Always handle null, single node, and last node carefully.
Can you explain it without the notes?
Linked list in Java
Use your own words. Explain an example and one limitation before checking the explanation.
Check your explanation
Node structure
Turn this concept into a clear answer.
Practice this conceptAdapted from 15_DSA_JAVA.md · “4. Linked list in Java”. Examples are study fragments; framework behavior can depend on your version.