Peculiar Partitioning

You are given an array a of length n. You need to find a sub-sequence S of the array such that gcd(s…

Click here to read the complete problem statement.

If you need help solving this problem, mention your approach and ask specific questions. Please avoid sharing your code and asking the Community to figure out “what’s wrong”.