## Leetcode - Shortest Word Distance III

https://leetcode.com/problems/shortest-word-distance-iii/

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

word1 and word2 may be the same and they represent two individual words in the list.

Example:
Assume that words = `["practice", "makes", "perfect", "coding", "makes"]`.

```Input: word1 = `“makes”`, word2 = `“coding”`
Output: 1
```
```Input: word1 = `"makes"`, word2 = `"makes"`
Output: 3
```

## Leetcode - Remove Element

https://leetcode.com/problems/remove-element/

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

```Given nums = [0,1,2,2,3,0,4,2], val = 2,

Your function should return length = `5`, with the first five elements of `nums` containing `0`, `1`, `3`, `0`, and 4.

Note that the order of those five elements can be arbitrary.

It doesn't matter what values are set beyond the returned length.```