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.