Using set || Very simple and easy to understand solution
Up vote if you like the solution\n# Approach\nTake a set to check total number of uniqe char in the final string.\nIn the set check :\n- if the total unique cha
<b>Up vote if you like the solution</b>\n# Approach\nTake a set to check total number of uniqe char in the final string.\nIn the set check :\n- if the total unique char count is 9\n- if the total size of the string s is 9\n- if there is no \'0\' in the string\n\n# Code\n```\nbool isFascinating(int n) {\n    string s = to_string(n) + to_string(n*2) + to_string(n*3);\n    unordered_set<char> st(s.begin(), s.end());\n    return (st.size() == 9 && s.size() == 9 && st.find(\'0\') == st.end() );\n}\n```\n<b>Here is an article of my recent interview experience at Amazon, you may like :\nhttps://leetcode.com/discuss/interview-experience/3171859/Journey-to-a-FAANG-Company-Amazon-or-SDE2-(L5)-or-Bangalore-or-Oct-2022-Accepted
['C++']