> For the complete documentation index, see [llms.txt](https://maksimdan.gitbook.io/interview-practice-problems/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/288-unique-word-abbreviation.md).

# 288 Unique Word Abbreviation

An abbreviation of a word follows the form \<first letter>\<number>\<last letter>. Below are some examples of word abbreviations:

```
a) it                      --
>
 it    (no abbreviation)

     1
b) d|o|g                   --
>
 d1g

              1    1  1
     1---5----0----5--8
c) i|nternationalizatio|n  --
>
 i18n

              1
     1---5----0
d) l|ocalizatio|n          --
>
 l10n
```

Assume you have a dictionary and given a word, find whether its abbreviation is unique in the dictionary. A word's abbreviation is unique if nootherword from the dictionary has the same abbreviation.

Example:

```
Given dictionary = [ "deer", "door", "cake", "card" ]

isUnique("dear") -
>
false

isUnique("cart") -
>
true

isUnique("cane") -
>
false

isUnique("make") -
>
true
```

* Simple map abr -> word, and then follow some boolean logic to check if it the abbreviation of a given string exists in the given dictionary.

```cpp
class ValidWordAbbr {
public:
    ValidWordAbbr(vector<string> &dictionary)
    {
        for (string s : dictionary) {
            string temp = *s.begin() +
                to_string(s.length() - 2) +
                *s.rbegin();

            // found
            if (abr_words.find(temp) != abr_words.end()) {
                abr_words[temp].insert(s);
            }

            // not found
            else 
            {
                unordered_set<string> temp_set;
                temp_set.insert(s);
                abr_words.insert(make_pair(temp, temp_set));
            }
        }
    }

    bool isUnique(string word)
    {
        // A word's abbreviation is unique if no other word from the dictionary 
        // has the same abbreviation.
        string temp = *word.begin() + 
            to_string(word.length() - 2) + 
            *word.rbegin();

        // no other word has the same abbreviation
        if (abr_words.find(temp) == abr_words.end()) return true;

        // other word has the same abbreviation
        else if (abr_words.find(temp) != abr_words.end()
            && abr_words[temp].find(word) != abr_words[temp].end()
            && abr_words[temp].size() == 1) return true;
        return false;
    }

private:
    // < abr , word >
    unordered_map<string, unordered_set<string>> abr_words;
};
```


---

# 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, and the optional `goal` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/288-unique-word-abbreviation.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

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.