Vivek and Birthday Celebration

#1

Any better time complexity for this problem than O(n^2) ?

#2

hi @ayushharshashu_fe6307ccd2e99f74
i think o(n^2) is a good soln for this problem, as not all problems can be solved in o(n)

1 Like
#3

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.