My Java Solution
\n// this can be simply done by iterating from 1 to n, take the ith and n-i value. Check if both the values are having zero, if not take these 2 numbers as the 
```\n// this can be simply done by iterating from 1 to n, take the ith and n-i value. Check if both the values are having zero, if not take these 2 numbers as the valid answer and save it, otherwise continue with the other one\n\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        if (n == 2)\n            return new int [] {1, 1};\n        int [] result = new int [2];\n        for (int i=1; i<=n; i++) {  //O(n)\n            int firstNumber = i;\n            int secondNumber = n - i;\n            if (isNoZero(firstNumber) && isNoZero(secondNumber)) { //O(i/10 * (n-i)/10)\n                result[0] = firstNumber;\n                result[1] = secondNumber;\n                break;\n            }\n        }\n        return result;\n    }\n    public boolean isNoZero(int n) {\n        while (n > 0) { \n            int rem = n % 10;\n            if (rem == 0)\n                return false;\n            n = n / 10;\n        }\n        return true;\n    }\n}\n```
['Math', 'Java']