buildmuse on Instagram: "90% of candidates fail graph problems because they pick the WRONG adjacency list type 💀 There are 2 ways to build adjacency lists in Java - and choosing wrong = instant failure. ZERO-INDEX (ArrayList): Use when nodes are 0 to n-1. Faster O(1) access, less memory. LeetCode problems usually give you n nodes numbered 0 to n-1. List > graph = new ArrayList (); for (int i = 0; i ()); } graph.get(0).add(1); // Edge 0->1 MAP-BASED (HashMap): Use when nodes are arbitrary (strin