You are given a string s and an integer k. Encrypt the string using the following algorithm:

For each character at index i in s, replace it with the character located $k$ positions ahead in a cyclic order, wrapping around to the beginning of the string if the end is exceeded.

Return the encrypted string.

Constraints:

• $1 \leq$ s.length $\leq 100$

• $1 \leq$ k $\leq 10^4$

• s consists only of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.