Available question text
Given two lists of unique strings, find all strings that appear in both lists whose sum of indices (i + j) is minimal, returning all ties in any order. Each list has unique entries and at least one common string (lengths up to 1000).
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 599. Minimum Index Sum of Two Lists
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source