Is this somekind of dp problem ?? , Any hint how to solve it , i made a map for starting and ending point of circle (c-r, c+r)
, what to next , How to approach such problems.
Maximum Circle - stl course
@shivampandey9599
hello Shivam,
now apply activity selection approach to find maximum number of non overlapping circles.
and then subtract this obtained value from total number of available cirlces