Leetcode 321. Create Maximum Number
Given two digit arrays and an integer k, pick subsequences (preserving relative order) from each array whose total length is k and merge them to form the lexicographically largest possible k-digit number. The challenge is choosing how many digits to take from each array and combining them optimally using greedy/lexicographic comparisons.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.