filmov
tv
Form Smallest Number From Two Digit Arrays #LeetCode #java #coding #intervewQuestions #dsa
Показать описание
Form Smallest Number From Two Digit Arrays #LeetCode #java #coding #intervewQuestions #dsa
#google #microsoft #amazon
2605. Form Smallest Number From Two Digit Arrays
Given two arrays of unique digits nums1 and nums2, return the smallest number that contains at least one digit from each array.
Example 1:
Input: nums1 = [4,1,3], nums2 = [5,7]
Output: 15
Explanation: The number 15 contains the digit 1 from nums1 and the digit 5 from nums2. It can be proven that 15 is the smallest number we can have.
Example 2:
Input: nums1 = [3,5,2,6], nums2 = [3,1,7]
Output: 3
Explanation: The number 3 contains the digit 3 which exists in both arrays.
#google #microsoft #amazon
2605. Form Smallest Number From Two Digit Arrays
Given two arrays of unique digits nums1 and nums2, return the smallest number that contains at least one digit from each array.
Example 1:
Input: nums1 = [4,1,3], nums2 = [5,7]
Output: 15
Explanation: The number 15 contains the digit 1 from nums1 and the digit 5 from nums2. It can be proven that 15 is the smallest number we can have.
Example 2:
Input: nums1 = [3,5,2,6], nums2 = [3,1,7]
Output: 3
Explanation: The number 3 contains the digit 3 which exists in both arrays.
0:05:56
0:03:00
0:07:10
0:02:15
0:01:05
0:09:10
0:05:20
0:00:06
4:11:52
0:08:13
0:00:26
0:04:49
0:00:16
0:00:25
0:03:05
0:16:10
0:00:31
0:03:40
0:03:12
0:00:18
0:00:13
0:00:16
0:00:10
0:08:14