Practice Create Maximum Number
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given two integer arrays nums1 and nums2 of lengths m and n respectively. nums1 and nums2 represent the digits of two numbers. You are also given an integer k. Create the maximum number of length k <= m + n from digits of the two numbers. The relative order of the digits from the same array must be preserved. Return an array of the k digits representing the answer.
Source: Create Maximum Number on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums1 = [3,4,6,5], nums2 = [9,1,2,5,8,3], k = 5
[9,8,6,5,3]
# Example 2
nums1 = [6,7], nums2 = [6,0,4], k = 5
[6,7,6,0,4]
# Example 3
nums1 = [3,9], nums2 = [8,9], k = 3
[9,8,9]
Constraints
Related LeetCode Problems
Practice more problems similar to Create Maximum Number.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.