Minimum Changes to Form K-Periodic Palindrome

Problem Statement

Minimum Changes to Form K-Periodic Palindrome Problem Description The current password is represented by the string currentPassword consisting only of lowercase Latin letters. New password requirements have just been released. The new password, called newPassword , must meet two specific requirements: It must be a palindrome. It must have a period of k . That is, newPassword[i] = newPassword[i+k] for all i such that i + k < length(newPassword) . The objective is to determine the minimum number of characters that need to be changed in currentPassword to create a newPassword of the same length. Function Description Complete the function findMinChanges in the editor with the following parameters: string currentPassword : the current password int k : the required period of the new password Returns int : the minimum number of characters to change to make a valid newPassword Examples Example 1: Input: currentPassword = "abzbz", k = 3 Output: 1 Explanation: Changing the first character of