Grokking Data Structures & Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Minimize the Maximum of Two Arrays (medium)
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Problem Statement

Given divisor1, divisor2, uniqueCnt1, and uniqueCnt2 integers, find the smallest possible maximum integer that could be present in either array after they are filled according to the below conditions.

  • You can take two arrays arr1 and arr2 which are initially empty.
  • arr1 contains total uniqueCnt1 different positive integers, each of them is not divisible by divisor1.
  • arr2 contains total uniqueCnt2 different positive integers, each of them is not divisible by divisor2.
  • There are no common integers in both arrays.

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible