Microsoft OA Nov 2022 IITB

<problem>270</problem> Given 2 arrays A and B we create a third array C such that C[i] is either A[i] or B[i] . Minimize the first missing positive integer in C and return it <problem>266</problem> Given 3 arrays A,B,C count the number of triplets {i,j,k} sucht that A[i] < B[j] < C[k]