Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 321. Create Maximum Number
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source