3210. Find the Encrypted String

You are given a string s and an integer k. Encrypt the string using the following algorithm: - For each character c in s, replace c with the kth character after c in the string (in a cyclic manner). Return the encrypted string. Example 1: Input: s = "dart", k = 3 Output: "tdar" Explanation: - For i = 0, the 3rd character after 'd' is 't'. - For i = 1, the 3rd character after 'a' is 'd'.