Company: Goldman sachs_4nov
Difficulty: medium
Non repeating digit in product Problem Description Given a number 'x', and a range of 'y' to 'z', please find the count of all the numbers 'n' in that range, such that the product of the number 'n' and 'x' does not contain any digit from the number 'n'. Examples Example 1: Input: x = 2, y = 10, z = 15 Explanation: We need to iterate through numbers 'n' from 10 to 15 (inclusive) and check the condition: For n = 10: Product = 2 * 10 = 20. Invalid , since the product (20) contains '0' which is a digit from 'n' (10). For n = 11: Product = 2 * 11 = 22. Valid , since the product (22) does not contain '1' from 'n' (11). For n = 12: Product = 2 * 12 = 24. Invalid , since the product (24) contains '2' which is a digit from 'n' (12). For n = 13: Product = 2 * 13 = 26. Valid , since the product (26) does not contain '1' or '3' from 'n' (13). For n = 14: Product = 2 * 14 = 28. Valid , since the product (28) does not contain '1' or '4' from 'n' (14). For n = 15: Product = 2 * 15 = 30. Valid , since