D. Constant Palindrome Sum

Problem Statement - here This question requires prior knowledge of computing prefix sum technique. This allows us to solve the question in O(N)So, for every pair (a[i],a[n-i-1]) -> we will…

Continue Reading D. Constant Palindrome Sum