Multiply Strings Problem

Multiply Strings Problem — ExecCode Easy DSA Practice

Solve the Multiply Strings problem on ExecCode. Free online easy DSA practice in Math. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Your task is to note: You must not use any built-in BigInteger library or convert the inputs to integer directly. Return the required answer exactly as shown in the examples.

Examples

Input {"num1": "2", "num2": "3"}; Output 6. Input {"num1": "123", "num2": "456"}; Output 56088. Input {"num1": "9", "num2": "9"}; Output 81

Constraints

1 <= num1.length, num2.length <= 200 num1 and num2 consist of digits only. Both num1 and num2 do not contain any leading zero, except the number 0 itself.

Practice Multiply Strings free on ExecCode. Browse DSA problems, topic map, and placement guides.