Jul 11, 2018 at 1:56pm UTC
@hackr1
now check your pm and make your promise.
Jul 11, 2018 at 2:03pm UTC
.
Last edited on Jul 11, 2018 at 2:17pm UTC
Jul 11, 2018 at 2:15pm UTC
@kashish
what are you thinking, reply on it.
Jul 11, 2018 at 2:33pm UTC
@ gear 1
After varying every character between a to z afterward u need to check how many characters are bigger than it so in checking process u will face TLE ...
According to ur approach u will get 30 only..
Jul 11, 2018 at 4:28pm UTC
i can give full ac sol of equilibrium prob if som1 can provide me with full ac solution for NSA or MNMNX.
PM me
Jul 11, 2018 at 6:18pm UTC
for clearing TLE of No minimum no maximum take some example u will get that a[I+1] multiplies same time as a[n-i] after sorting array it makes a combination.
And use combination property nCr = nCn-r
Jul 12, 2018 at 3:46pm UTC
Anyone got 100 pts in NSA please give hint towards approach
Jul 12, 2018 at 4:39pm UTC
could u please share your approach to the problem here @gear1
Jul 12, 2018 at 5:44pm UTC
@gear1
U cleared TLE of no strings attached
Jul 13, 2018 at 7:45am UTC
@gear1
can u help me in NSA i got only 30 ... by varying every character and checking it..
allow pm.
Jul 13, 2018 at 10:48am UTC
@pewdiepie007
It's for check-in sj>si not si>sj
Jul 14, 2018 at 2:31am UTC
@pewdiepie
I have done with ur code but cant pm u back becoz i exceed the limit