Concept

Collections

Average lookup and update are O(1) when hashes spread well. Heavy collisions degrade toward O(n) — interview material covers capacity and load factor in depth.

Where it fits

  1. Core Java
  2. Collections

Packages: Core Java (pkg1core), Data structures (pkg3datastructures), LeetCode (pkg5leetcode), JVM (pkg6jvm)

Learn

Existing chapters for this concept.

  • Collections

    Core Java

    Average lookup and update are O(1) when hashes spread well. Heavy collisions degrade toward O(n) — interview material covers capacity and load factor in depth.

    Open lesson

See it in code

Existing Java examples.

  • core 19 Collections Demo

    Core Java · pkg1core/core19CollectionsDemo.java · pkg1core · core19CollectionsDemo.java

    - List: ordered, indexed, allows duplicates (ArrayList / LinkedList). - Set: no duplicates (HashSet=unordered, LinkedHashSet=insertion, TreeSet=sorted). -…

    Open example
  • jvm 3 Garbage Collection Demo

    JVM · pkg6jvm/jvm3GarbageCollectionDemo.java · pkg6jvm · jvm3GarbageCollectionDemo.java

    Open example
  • core29HashMapDemo

    Core Java · pkg1core/core29HashMapDemo.java · pkg1core · core29HashMapDemo.java

    - Keys are unique; put with an existing key replaces the value. - Lookup uses hashCode (bucket) then equals (match within the bucket). - Mutating a key after…

    Open example
  • core28ComparatorDemo

    Core Java · pkg1core/core28ComparatorDemo.java · pkg1core · core28ComparatorDemo.java

    - Comparable: built into the class (`compareTo`). One natural ordering. - Comparator: external, multiple orderings, lambdas/method refs. - Use…

    Open example
  • datastructures6HashTableImpl

    Data structures · pkg3datastructures/datastructures6HashTableImpl.java · pkg3datastructures · datastructures6HashTableImpl.java

    Open example
  • blind75_LC1TwoSum

    Blind 75 · Array · pkg5leetcode/blind75/blind75_LC1TwoSum.java · pkg5leetcode · blind75_LC1TwoSum.java

    One-pass hash map stores value->index; check complement each step. Time O(n), Space O(n)

    Open example
  • blind75_LC49GroupAnagrams

    Blind 75 · String · pkg5leetcode/blind75/blind75_LC49GroupAnagrams.java · pkg5leetcode · blind75_LC49GroupAnagrams.java

    HashMap keyed by sorted char signature. Time O(n k log k), Space O(nk)

    Open example

Prepare

Existing interview questions.

Java versions