Skip to content

Latest commit

 

History

History
33 lines (20 loc) · 798 Bytes

README.md

File metadata and controls

33 lines (20 loc) · 798 Bytes

LeetCode 43. Multiply Strings

Problem Description

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.

Each number in candidates may only be used once in the combination.

Note: The solution set must not contain duplicate combinations.

Test Cases

Example 1:

Input: num1 = "2", num2 = "3"

Output: "6"

Example 2:

Input: num1 = "123", num2 = "456"

Output: "56088"

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.

Link

https://leetcode.com/problems/multiply-strings/