Search
⌘K
Leetcode 599. Minimum Index Sum of Two Lists
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.