Is there an efficient solution to this problem than O(n^2)

#1
#2

Hello @anshufirefox i think youor O(N^2) approach will also work fine as the constraints are not larger.
Happy Learning!!

#3

could you please help me debug my code, it doesn’t seem to work

#4

Thushar bhaiya reply please

#5

Hello @anshufirefox wait letme see your code:

#6

yeah, were you able to find the fault?

#7

Hey @anshufirefox your logic is not finding according to the conditions.
it took me time to understand your logic using n2 approach then i have reimplemented it.
you can check it here:


if you dont understand this you can ask here:
Happy Learning!!

#8

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.