Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3682. Minimum Index Sum of Common Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source