public class Solution $\{$

static int findMinCost$($int n$,$ int k$,$ String s$)\{$

int m $=$ n $/$ k;

int totalCost $=0$;

for $($int i $=0$; i $<$ k; i$++)\{$

int$[]$ charCount $=$ new int$[26]$; $//$ Assuming lowercase English letters

for $($int j $=$ i; j $<$ n; j $+=$ k$)\{$

charCount$[$s$.$charAt$($j$)-\text{'}$a$\text{'}]++$;

$\}$

int maxCount $=0$;

for $($int count : charCount$)\{$

maxCount $=$ Math.max$($maxCount$,$ count$)$;

$\}$

totalCost $+=($m $-$ maxCount$)$;

$\}$

return totalCost;

$\}$

public static void main$($String$[]$ args$)\{$

int t $=2$;

int n$1=93,$ k$1=3$;

String s$1=$ "khkkdkuki";

System.out.println$($findMinCost$($n$1,$ k$1,$ s$1))$; $//$ Output: $5$

int n$2=93,$ k$2=3$;

String s$2=$ "kegohsirj";

System.out.println$($findMinCost$($n$2,$ k$2,$ s$2))$; $//$ Output: $6$

$\}$

$\}$ i want this code in different way