Count pairs of non overlapping Substrings of size K which form a palindromic String –…
Given a string S of length l, the task is to count the number of pairs of two non-overlapping substrings of length K of the string S, such that on joining the two non-overlapping substrings the resultant string is a…