Java Set Solution
\n# Code\n\nclass Solution {\n    public boolean isFascinating(int n) {\n        String strs = Integer.toString(n) + Integer.toString(2 * n) + Integer.toString(
\n# Code\n```\nclass Solution {\n    public boolean isFascinating(int n) {\n        String strs = Integer.toString(n) + Integer.toString(2 * n) + Integer.toString(3 * n);\n        Set<Integer> set = new HashSet<>();\n\n        for (int i = 0; i < strs.length(); i++) {\n            int curr = strs.charAt(i) - \'0\';\n            if (curr == 0) {\n                return false;\n            }\n            if (set.contains(curr)) {\n                return false;\n            }\n            set.add(curr);\n        }\n\n        return set.size() == 9;\n    }\n}\n```
['Java']