Leetcode 2513. Minimize the Maximum of Two Arrays

Find the smallest x such that from numbers 1..x you can choose disjoint sets of sizes uniqueCnt1 and uniqueCnt2 where the first set contains only numbers not divisible by divisor1 and the second only numbers not divisible by divisor2. Use counts computed by inclusion–exclusion (via lcm) to test feasibility for a given x and binary search the minimum x.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2513. Minimize the Maximum of Two Arrays

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact