Maximum Circles - Greedy approach

#1

I have solved and submitted the Maximum Circles problem (in hackerblocks) via the Greedy approach. However, I think the greedy approach is wrong for this question. Consider a case like:

Greedy

In such cases, the minimum is 1 (Remove 1) but our Greedy approach shall yield the answer as 2 (As 2 and 3 conflict with 1). Please correct my understanding should it be flawed.

What is the right approach that accounts for such cases too?

#2

Hey Shubham, in this problem out greedy approach will give the output 1 only.
One approach for solving this problem can be if you calculate the no. of non-overlapping circles and subtract them from total circles. It will give you the minimum no. of circles to be removed.