[tutorial:1037A]↵
**Problem Authors**: [user:GT_18,2018-09-02], [user:karansiwach360,2018-09-02]↵
↵
**Author`s Code**: [submission:42406878]↵
↵
**Code Complexity**: $O(LogN)$↵
↵
[tutorial:1037B]↵
**Problem Authors**: [user:csgocsgo,2018-09-02], [user:karansiwach360,2018-09-02]↵
↵
**Author`s Code**: [submission:42406891]↵
↵
**Code Complexity**: $O(NLogN)$↵
↵
[tutorial:1037C]↵
**Problem Authors**: [user:csgocsgo,2018-09-02], [user:ezio07,2018-09-02]↵
↵
**Author`s Code**: [submission:42406848]↵
↵
**Code Complexity**: $O(N)$↵
↵
[tutorial:1037D]↵
**Problem Author**: [user:ezio07,2018-09-02]↵
↵
**Author`s Code**: [submission:42406857]↵
↵
**Code Complexity**: $O(NLogN)$↵
↵
[tutorial:1037E]↵
**Problem Authors**: [user:dhirajfx3,2018-09-02], [user:GT_18,2018-09-02], [user:praran26,2018-09-02]↵
↵
**Author`s Code**: [submission:42406908]↵
↵
**Code Complexity**: $O(NLogN)$↵
↵
[tutorial:1037F]↵
**Problem Authors**: [user:karansiwach360,2018-09-02], [user:hitman623,2018-09-02]↵
↵
**Author`s Code**: [submission:42406921]↵
↵
**Code Complexity**: $O(N)$↵
↵
[tutorial:1037G]↵
**Problem Authors**: [user:300iq,2018-09-02]↵
↵
**Author`s Code**: [submission:42406934]↵
↵
**Code Complexity**: $O(26^2*N+26*Q)$↵
↵
[tutorial:1037H]↵
↵
↵
↵
**Problem Authors**: [user:dhirajfx3,2018-09-02], [user:dark_n8,2018-09-02]↵
↵
**Author`s Code**: [submission: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.
**Problem Authors**: [user:GT_18,2018-09-02], [user:karansiwach360,2018-09-02]↵
↵
**Author`s Code**: [submission:42406878]↵
↵
**Code Complexity**: $O(LogN)$↵
↵
[tutorial:1037B]↵
**Problem Authors**: [user:csgocsgo,2018-09-02], [user:karansiwach360,2018-09-02]↵
↵
**Author`s Code**: [submission:42406891]↵
↵
**Code Complexity**: $O(NLogN)$↵
↵
[tutorial:1037C]↵
**Problem Authors**: [user:csgocsgo,2018-09-02], [user:ezio07,2018-09-02]↵
↵
**Author`s Code**: [submission:42406848]↵
↵
**Code Complexity**: $O(N)$↵
↵
[tutorial:1037D]↵
**Problem Author**: [user:ezio07,2018-09-02]↵
↵
**Author`s Code**: [submission:42406857]↵
↵
**Code Complexity**: $O(NLogN)$↵
↵
[tutorial:1037E]↵
**Problem Authors**: [user:dhirajfx3,2018-09-02], [user:GT_18,2018-09-02], [user:praran26,2018-09-02]↵
↵
**Author`s Code**: [submission:42406908]↵
↵
**Code Complexity**: $O(NLogN)$↵
↵
[tutorial:1037F]↵
**Problem Authors**: [user:karansiwach360,2018-09-02], [user:hitman623,2018-09-02]↵
↵
**Author`s Code**: [submission:42406921]↵
↵
**Code Complexity**: $O(N)$↵
↵
[tutorial:1037G]↵
**Problem Authors**: [user:300iq,2018-09-02]↵
↵
**Author`s Code**: [submission:42406934]↵
↵
**Code Complexity**: $O(26^2*N+26*Q)$↵
↵
[tutorial:1037H]↵
↵
↵
↵
**Problem Authors**: [user:dhirajfx3,2018-09-02], [user:dark_n8,2018-09-02]↵
↵
**Author`s Code**: [submission: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.
