one case TLE and one case is not passing
question ) https://hack.codingblocks.com/app/practice/1/149/problem
my answer ) https://ide.codingblocks.com/s/248272
one case TLE and one case is not passing
question ) https://hack.codingblocks.com/app/practice/1/149/problem
my answer ) https://ide.codingblocks.com/s/248272
@N4i9kita
for query of first type you need not to manipulate the whole string. It will lead to TLE since for each query of first type you might have to iterate over whole string. Just maintain a count=0 and for every query of first type increment count by ar[1][1]. then for query to second type print cout<<char(((s[j]-‘a’+count)%26)+‘a’); for all 0<=j<a[i][1].
This will reduce time
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.