How to solve maximum circle problem

#1

1366×768 61.8 KB

#2

hello @officialharshit1996 do you need the code of this question ?

#3

yes, give me hint for this problem

#4

hey @officialharshit1996 the approach is simple try to sort by the ending index i.e the c+r and after this run the loop in which you can compare if the ending of the first circle is less then the starting of the second circle then you need to increment one counter. i.e overlapping .
here i am attaching the code for your reference :


if you have any doubt in understanding you can ask here :
Happy Learning !!

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.