[Feature]: Add 245. Shortest Word Distance III solution

[sivaprasath2004]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

245.Shortest Word Distance III (Premium / Problem)

• Given an array of strings wordsDict and two strings that already exist in the array word1 and word2, return the shortest distance between the occurrence of these two words in the list.

• Note that word1 and word2 may be the same. It is guaranteed that they represent two individual words in the list.

Example 1:
- Input: wordsDict = [“practice”, “makes”, “perfect”, “coding”, “makes”], word1 = “makes”, word2 = “coding”
- Output: 1

Example 2:
- Input: wordsDict = [“practice”, “makes”, “perfect”, “coding”, “makes”], word1 = “makes”, word2 = “makes”
- Output: 3

Constraints:

1 <= wordsDict.length <= 105
1 <= wordsDict[i].length <= 10

Use Case

-please assign me..

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository

[github-actions]

Hi @sivaprasath2004! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[sivaprasath2004]

Hello @ajay-dhangar please assign me..

[github-actions]

Hello @sivaprasath2004! Your issue #3890 has been closed. Thank you for your contribution!