Back to problems

Multiply Strings (LC 43)

Algorithm · Microsoft · Medium

Examples Example 1 Example 2 Requirements You receive two strings, num1 and num2, each representing a non-negative integer. Produce their multiplication result as a string. Converting either value to built-in int / BigInteger representations is prohibited, as is using any big-integer library. Each input may contain roughly 200 digits. Examples: Interviewers commonly check whether the output avoids unnecessary zero prefixes: multiplying "0" by "123" must yield "0" rather than…

Checking your access…