class Solution {
public int findClosest(String[] words, String word1, String word2) {
int n = words.length;
List<Integer> list1 = new ArrayList<>();
List<Integer> list2 = new ArrayList<>();
int min = Integer.MAX_VALUE;
for(int i = 0;i < n;i++){
if(words[i].equals(word1)){
list1.add(i);
if(list2.size() != 0){
min = Math.min(min,Math.abs(i - list2.get(list2.size() - 1)));
}
}
if(words[i].equals(word2)){
list2.add(i);
if(list1.size() != 0){
min = Math.min(min,Math.abs(i - list1.get(list1.size() - 1)));
}
}
}
return min;
}
}