2911. Minimum Changes to Make K Semi-palindromes | Weekly Leetcode 368

[@codingmohan]

Sorry for the late upload. Was watching World cup and it was worth finally :)

[@prakhargarg4166]

For case, s = "edaswf" k = 1, why answer is 2 and not 3

[@gauravgautam5963]

Best explanation , Thankyou ❤❤

[@durgaprasadvelagapudi5263]

in the psuedo-code to calculate the semi-palindome for a string of len = n, while calculating right , n should be replaced with len. Understanding the problem statement around semi-palindrome for me was impossible during the contest. your explanation of the problem ask and the logic around calculating min changes to make a string semi-palindome is very intuitive.

[@codingmohan]

Oh yes. I somehow missed while writing. But I think the intuition should be clear :) Glad you find it helpful :)

[@teqarine5752]

while calculating the factors, why have you started i from j+j and not from j itself? j is also a factor of itself isnt it?

[@codingmohan]

It is but the definition of semi-palindrome doesn’t allow that - d < len

[@gauravmandal01]

i was waiting for this video all the other contest video are literally broken thanks a lot i was able to solve 3 problems

[@lakshyaagrawal6682]

Thanks for the video Can you please make a new video on 2902. Count of Sub-Multisets With Bounded Sum Your code in that video is giving TLE and I think the other approach will be a really good learning for us.