Divisible by 3

For given an integer number n, calculate the number of distinct and valid ways of rearranging the di…

Click here to read the complete problem statement.


If you need help solving this problem, mention your approach and ask specific questions. Please avoid sharing your code and asking the Community to figure out “what’s wrong”.

For(i,s.size())
For(j=i,s.size())

How it can be TLE?

There is a typing mistake. The maximum size of the string will be 10^6. That is why you got TLE.

1 Like

thank you…