Regarding lapindromes

can any one please help me to understand lapindromes problem flow of execution and how to write it code plz guys help me…:slight_smile:

The problem question states that the lapindromes is string when divided contains same characters with same frequency in both the parts.In case if the length of sring is odd ignore the middle character and check for the conditions on both the parts .