Problem Authors: GT_18, karansiwach360

Author`s Code: 42406878

Code Complexity: O(LogN)

Problem Authors: csgocsgo, karansiwach360

Author`s Code: 42406891

Code Complexity: O(NLogN)

Problem Authors: csgocsgo, Ezio07

Author`s Code: 42406848

Code Complexity: O(N)

Problem Author: Ezio07

Author`s Code: 42406857

Code Complexity: O(NLogN)

Problem Authors: dhirajfx3, GT_18, TooDumbToWin

Author`s Code: 42406908

Code Complexity: O(NLogN)

Problem Authors: karansiwach360, hitman623

Author`s Code: 42406921

Code Complexity: O(N)

Problem Authors: 300iq

Author`s Code: 42406934

Code Complexity: O(26² * N + 26 * Q)

Problem Authors: dhirajfx3, DeshiBasara

Author`s Code: 42406942

Code Complexity: O(|x| * LogN * 26) per request.

We hope you enjoyed the problems!

Hope to see you all in next edition of Manthan.

Following are my two C++ submissions for today`s contest AIM Tech Round 5 problem C,

Time Limit Exceeded

Accepted

Both are exactly same except an extra semicolon.

The solution is of O(NlogN) time complexity. Although my submissions were after the contest, but its highly likely that some users may have faced the similar issue during the contest, which is unfortunate.