Skip to main content

Index Pairs of a String


Given a string, find all pairs of indices in the string such that the substring with the two indices as boundaries is a palindrome.

Example 1
Input: text = "ababa"

Output: [[0,1], [0,3], [2,3], [2,4]]


all//Index Pairs of a

def index_pair(string):
result = []
for i in range(len(string)):
for j in range(i + 1, len(string)):
result.append((i, j))
return result

# Driver Code
string = 'geeksforgeeks'