Leetcode 3682. Minimum Index Sum of Common Elements

Given two lists of strings, find all strings that appear in both lists whose sum of indices (index in list1 + index in list2) is minimal, returning all ties. This is a hashmap + single-pass pattern to compute index sums efficiently in linear time.