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 k<sup>th</sup> character after c in the string (in a cyclic manner).

Return the encrypted string.

LeetCode Problem - 3210

class Solution {
    public String getEncryptedString(String s, int k) {
        // Initialize a StringBuilder to build the encrypted string
        StringBuilder sb = new StringBuilder();
        // Get the length of the input string
        int n = s.length();

        // Iterate through each character of the input string
        for (int i = 0; i < n; i++) {
            // Append the character at the new position (i + k) % n to the StringBuilder
            sb.append(s.charAt((i + k) % n));
        }

        // Convert the StringBuilder to a string and return it
        return sb.toString();
    }
}