Tagged articles
LinkedList
15 articles · Page 1 of 1
This article systematically examines ten typical pitfalls encountered when converting arrays to lists, performing add/remove operations, using subList, handling memory consumption, and working with thread‑safe collections such as CopyOnWriteArrayList in Java, and provides concrete code‑level solutions and performance recommendations.
ConcurrencyCopyOnWriteArrayListLinkedList
0 likes · 20 min read

This article examines common traps when using Java List structures such as Arrays.asList, ArrayList, LinkedList, and CopyOnWriteArrayList, explains why they occur, and provides practical solutions—including proper conversion, avoiding unsupported operations, handling subList references, and mitigating memory and concurrency issues.
Arrays.asListCopyOnWriteArrayListJava
0 likes · 19 min read

This article reveals common pitfalls when using Java List implementations—such as Arrays.asList with primitive arrays, unsupported add/remove operations, side‑effects on the original array, subList memory leaks, LinkedList performance myths, and CopyOnWriteArrayList’s memory and iterator quirks—while providing practical solutions and best‑practice recommendations.
CopyOnWriteArrayListJavaLinkedList
0 likes · 19 min read

This article benchmarks Java's ArrayList and LinkedList by measuring insertion and lookup times at the head, tail, and middle of a list with 100,000 elements, then explains the underlying source‑code mechanisms that cause the observed performance differences.
BenchmarkJavaLinkedList
0 likes · 10 min read

This article explains the internal workings of Java's ArrayList and LinkedList, covering their dynamic array and linked list structures, growth mechanisms, performance characteristics for random access, insertion, and deletion, and includes source code excerpts and visual diagrams to illustrate key differences.
JavaLinkedListarraylist
0 likes · 4 min read

This article explains why ArrayList implements the RandomAccess marker interface while LinkedList does not, shows how Java's Collections.binarySearch chooses different algorithms based on this interface, and presents benchmark results that reveal the most efficient traversal method for each list type.
LinkedListRandomAccessarraylist
0 likes · 7 min read

This article provides a detailed examination of the JDK 1.8 LinkedList class, covering its internal fields, constructors, node structure, and core methods for adding, retrieving, and removing elements, while highlighting performance characteristics and differences from ArrayList.
JDKJavaLinkedList
0 likes · 15 min read

This article explains the differences between Java's ArrayList and LinkedList, detailing their internal implementations, performance characteristics for adding, inserting, deleting, and iterating elements, and provides code examples and benchmark results to guide when to choose each collection.
JavaLinkedListarraylist
0 likes · 11 min read

This article provides a detailed comparison of Java's List interface implementations—ArrayList, LinkedList, Vector, and Stack—explaining their underlying data structures, key methods such as get, set, add, and remove, performance characteristics, thread safety, and appropriate usage scenarios.
JavaLinkedListList
0 likes · 18 min read

This article provides a comprehensive overview of Java's LinkedList class, covering its definition, internal node structure, constructors, element addition and removal methods, traversal techniques, iterator behavior, and concurrency considerations, all illustrated with complete source code examples.
ConcurrencyJavaLinkedList
0 likes · 14 min read

The article recounts a Java interview where the interviewer explains the memory layout, random‑access capability, and time‑complexity differences between ArrayList (array‑based) and LinkedList (node‑based), using clear examples and code snippets to illustrate fundamental data‑structure concepts.
InterviewJavaLinkedList
0 likes · 8 min read

This article systematically explains the most frequently used Java data structures—including LinkedList, ArrayList, Stack, Queue, HashMap, and LinkedHashMap—detailing their internal implementations, typical operations, performance characteristics, and providing illustrative code snippets and animations.
HashMapJavaLinkedList
0 likes · 8 min read

This article systematically explains common Java collection classes—including LinkedList, ArrayList, Stack, Queue, HashMap, and LinkedHashMap—highlighting their internal structures, key operations, performance characteristics, and JDK 8 differences, and it provides animated illustrations and full code snippets for each concept.
HashMapJavaLinkedList
0 likes · 9 min read

This article dissects Java 8’s LinkedList class, explaining its double‑linked node structure, key fields, constructors, and core methods such as add, remove, clear, get, and set, while contrasting its performance characteristics with ArrayList for insertion, deletion, and random access.
JavaLinkedListdata structures
0 likes · 14 min read

This article explains the principles behind Java's mutable array implementations, details the characteristics and use‑cases of List, ArrayList, LinkedList, and Vector, and provides code examples for common operations such as adding, removing, setting, retrieving elements, and using iterators.
LinkedListListVector
0 likes · 8 min read
