> For the complete documentation index, see [llms.txt](https://ugopireddy.gitbook.io/leet-code-solutions/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://ugopireddy.gitbook.io/leet-code-solutions/solutions-201---250/243-shortest-word-distance-easy.md).

# 243 Shortest Word Distance – Easy

### Problem:

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.

For example, Assume that words = \[“practice”, “makes”, “perfect”, “coding”, “makes”].

Given word1 = “coding”, word2 = “practice”, return 3. Given word1 = “makes”, word2 = “coding”, return 1.

Note: You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.

### Thoughts:

The solution is very easy. Keep two index to remember the last appear index for each word. Also have a variable to keep the current shortest distance.

### Solutions:

```java
class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        Integer i1 = null;
        Integer i2 = null;
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < words.length; i ++) {
            if (words[i].equals(word1)) {
                i1 = i;
            }
            if (words[i].equals(word2)) {
                i2 = i;
            }
            if (i1 != null && i2 != null) {
                min = Math.min(min, Math.abs(i1 - i2));
            }
        }
        return min;
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://ugopireddy.gitbook.io/leet-code-solutions/solutions-201---250/243-shortest-word-distance-easy.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.