How should I practice Smallest Binary-Digit Multiple?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Myntra onsite interview problems in FastPrep.

Is Smallest Binary-Digit Multiple associated with Myntra?

FastPrep tags this as a Myntra onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Breadth First Search

Smallest Binary-Digit Multiple

Learn this problem

● Medium

MyntraINTERNONSITE INTERVIEW

Problem statement

Given a positive integer n, return the numerically smallest positive decimal integer that is divisible by n and whose decimal representation contains only the digits 0 and 1.

The representation must begin with 1. Return the result as a string because it may not fit in a built-in integer type.

Function

smallestBinaryDigitMultiple(n: int) → String

Examples

Example 1

n = 2return = "10"

The decimal number 10 uses only allowed digits and is divisible by 2.

Example 2

n = 3return = "111"

Neither 1, 10, 11, 100, 101, nor 110 is divisible by 3; 111 is the first valid number.

Example 3

n = 7return = "1001"

The value 1001 equals 7 multiplied by 143.

Constraints

1 <= n <= 20000.