my solution has time complexity of O(n*k) k = first k characters from a to z n = size of string but solution got TLE how to optimize it? link to the question and my solution:

Coding Competitions

Kick Start — Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all.

https://www.codechef.com/viewsolution/46839080

thanks in advance