Algorithm · Citadel · Medium
Palindromic Segments Medium · Topics · Company Tags · Hints You are given a string s of length n consisting only of lowercase English letters, and an integer k that divides n. Split s into n/k contiguous segments, each of exactly k characters. For instance, the first segment is s[0..k-1], the second is s[k..2k-1], and so on. In a single operation, you can change any character of s to any other lowercase letter. Determine the minimum number of such operations needed so that…
Checking your access…