#2 - Medium Question: Sequential Display As an architect, you were given a vacant plot of land with K consecutive sections. Each section has the capacity to display one architectural element. Your goal is to create a design pattern, represented by a string S with a length N > K. However, due to space limitations, you need to display the string in N-K+1 stages. In the i-th stage (1≤i≤N-K+1), you will arrange the architectural elements to showcase the characters s[i], s[i+1], ..., s[i+K-1]. The energy required to transition from stage i to stage i+1 (for 1≤i≤N-K) is directly proportional to the number of architectural elements that need to be rearranged between these stages. You need to determine the total energy required for the entire process of displaying the string, which is the sum of energies required for transitioning between all consecutive pairs of stages.
