RAMCRYPT - Editorial

Problem link:##

Contest , Practice

Setter: Debjit Datta

Tester: Debjit Datta
##Difficulty:##
Cakewalk
##Prerequisites:##
Modular arithmetic, string

##Explanation:##
Given a String and an integer with which we need to decrypt the encrypted string, we need to
decrypt the string.

We traverse through the string and for each character, we first find out the index of the
character(i.e distance form ‘a’) and then add n to the index. Then we do modular operation by
26 and then store the decrypted character in the result string.
##Time complexity:##
O(m) where m is the size of string
##Author’s and Tester’s Solution:##
Author’s solution is here