Another Casual Coder

Well, Claude does it again. Even against the powerful GPT 4o with Canvas, there is no match compared with the kids from Anthropic.

Problem was this one: Total Characters in String After Transformations I - LeetCode

My implementation usually is the worst, but works:

public int LengthAfterTransformations(string s, int t)
{
 BigInteger[] countChars = new BigInteger[26];
 long MOD = 1000000000 + 7;
 foreach (char c in s)
 countChars[(int)(c - 'a')]++;
 for (int i = 0; i < t; i++)
 {
 BigInteger ab = countChars[countChars.Length - 1];
 for (int j = countChars.Length - 1; j > 0; j--)
 countChars[j] = countChars[j - 1];
 countChars[0] = ab;
 countChars[1] += ab;
 }
 BigInteger retVal = 0;
 for (int i = 0; i < countChars.Length; i++)
 retVal += countChars[i];
 return (int)(retVal % MOD);
}

ChatGPT improved the performance significantly, but Anthropic Claude just killed it, with the following solution:

public int LengthAfterTransformations(string s, int t)
{
 const int MOD = 1_000_000_007;
 var counts = new long[26];
 
 // Count initial frequencies
 foreach (char c in s)
 {
 counts[c - 'a']++;
 }
 
 // Perform transformations
 for (int i = 0; i < t; i++)
 {
 // Store last character count (z)
 long lastChar = counts[25];
 
 // Shift all characters right
 for (int j = 25; j > 0; j--)
 {
 counts[j] = counts[j - 1];
 }
 
 // Handle wrapping of 'z' to 'a' and incrementing 'b'
 counts[0] = lastChar;
 counts[1] = (counts[1] + lastChar) % MOD;
 }
 
 // Calculate final sum
 long sum = 0;
 for (int i = 0; i < 26; i++)
 {
 sum = (sum + counts[i]) % MOD;
 }
 
 return (int)sum;
}