Freaks City

Suppose you are given an integer array arr. The goal is to split it into the fewest possible subsets such that every pair of elements inside the same subset is coprime (their greatest common divisor equals 1). We can solve this problem using a DFS backtracking approach. Below are two distinct strategies, each corresponding to a different way of ...