Given arrays A and B, build C with C[i] chosen from A[i] or B[i] so that the smallest missing positive integer of C is as small as possible, and return it.
Unlock detailed company stats for this questionUpgrade
Community answers
No answers contributed by the community yet.
Related questions
Given a sorted array of distinct positive integers and m, choose m elements so that the smallest gap between any two chosen elements is as large as possible, and return that gap.Arrays A and B hold dice faces from 1 to 6. Return the minimum number of dice to change so that both arrays have the same sum, or -1 if it is impossible.Remove k consecutive elements from an array so that max minus min of the remaining elements is as small as possible.Related courses
Course