Minimize changes for k-periodic palindrome

Q: Minimize changes for k-periodic palindrome

This question evaluates understanding of string algorithms and combinatorial reasoning, focusing on palindrome properties combined with k-periodicity and the ability to minimize character changes under global constraints.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Question

Given a string currentPassword (length N) and an integer k (1 ≤ k < N, N ≤ 2·10^5, lowercase letters, N divisible by k), find the minimum number of character changes needed to transform currentPassword into a newPassword such that (

newPassword is a palindrome and (
newPassword[i] = newPassword[i + k] for all valid i (k-periodic). Return that minimum number of changes.

https://www.geeksforgeeks.org/minimum-replacements-required-to-obtain-a-k-periodic-palindromic-string/

Minimize changes for k-periodic palindrome

Overview

Question

Comments (0)