Algorithms
Series Overview & How to Use
Navigate this visual DSA cheatsheet series. Learn how to use interactive visualizers and get the most from each article.
Algorithms
ArrayList / Dynamic Array
Visual guide to ArrayList: dynamic resizing, amortized O(1) append, O(n) insert. Interactive visualizer shows resize operations.
Algorithms
LinkedList
Visual guide to LinkedList: node-based structure, O(1) insert/delete at ends, O(n) access. See pointer manipulation in action.
Algorithms
HashMap / Hash Table
Visual guide to HashMap: hashing, buckets, collision handling. Watch how keys map to values with O(1) average operations.
Algorithms
TreeSet / Binary Search Tree
Visual guide to TreeSet/BST: self-balancing trees, sorted operations. See insertions and rotations in real-time.
Algorithms
PriorityQueue / Heap
Visual guide to PriorityQueue: binary heap, sift-up/sift-down operations. See how priority ordering is maintained.
Algorithms
ArrayDeque / Circular Buffer
Visual guide to ArrayDeque: circular buffer, O(1) operations at both ends. Watch head/tail pointers wrap around.
Algorithms
LinkedHashMap
Visual guide to LinkedHashMap: hash table + linked list for order preservation. Perfect for LRU cache implementation.
Algorithms
EnumSet / Bit Vector
Visual guide to EnumSet: bit vector representation for enum values. See ultra-fast set operations on bits.
Algorithms
Binary Search
Visual guide to Binary Search: halving search space each step. Watch the algorithm find targets in O(log n) time.
Page 1 of 3