Easy  C++ Solution 
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    string entityParser(string text) {
        int n = text.size();
        string ans = "";
        unordered_map<string,char>m;
        m["&quot;"] = '"';
        m["&apos;"] = '\'';
        m["&amp;"] = '&';
        m["&gt;"] = '>';
        m["&lt;"] = '<';
        m["&frasl;"] = '/';

        int i = 0;
        while(i<n)
        {
            if(text[i]=='&')
            {
                int j = i+1;
                while(j<n && text[j]!=';')
                j++;

                if(j==n)
                {
                    ans+=text[i];
                    i++;
                    continue;
                }
                if(j<n && text[j]==';')
                {
                    string temp = text.substr(i,j-i+1);
                    //kya ye map mai present hai string
                    if(m.find(temp)!=m.end())
                    {
                        ans += m[temp];
                        i = j;
                    }

                    else //not found
                    {
                        ans+=text[i];
                    }
                }
                i++;
            }
            else
            {
                ans+=text[i];
                i++;
            }
        }

       return ans;
    }
};
```
['C++']