c++ EZiest solution (0ms)
starting with two values for a and b (n-1 and 1),\n check if character zero is present; if yes, decrement one and increment the other.\n use to_string to find c
* starting with two values for a and b (n-1 and 1),\n* check if character zero is present; if yes, decrement one and increment the other.\n* use to_string to find character representation of each int.\n```\n\nvector<int> getNoZeroIntegers(int n) {\n        int a = n - 1;\n        int b = 1;\n        while (to_string(a).find("0")!=string::npos   || to_string(b).find("0")!=string::npos) {\n            --a;\n            ++b;\n        }\n        \n        return {a,b};\n    }\n
['C']