2605. Form Smallest Number From Two Digit Arrays

LeetCodeArrayHash TableEnumerationOpen on judge ↗

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

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI