Maximum Circles Approach

#1

How can I approach this problem?

#2

This is simple activity selection problem. Consider, for each circle, its beginning at center - r and ending at c+r. Now greedily select activities by sorting them according to their ending.

#3

So, I didn’t study greedy approach. But, if you give some steps to do, it’ll be helpful

#4

This link should help https://www.geeksforgeeks.org/activity-selection-problem-greedy-algo-1/

#5

I have a doubt. If both circles end are same then how can I sort the two circle?

#6

It doesn’t matter , just sort using ending time , if ending time is same sort using start time. Now the algorithm will automatically pick the best one