Find minimum number of merge operations to make an array palindrome - javascript

[smoholkar]

Given an array of positive numbers, make it a ‘Palindrome’. Only allowed operation on array is merge. Merging two adjacent elements means replacing them with their sum. The task is to find minimum number of merge operations required to make given array a ‘Palindrome’.

To make an array a palindromic we can simply apply merging operations n-1 times where n is the size of array (Note a single element array is alway palindrome similar to single character string). In that case, size of array will be reduced to 1. But in this problem we are asked to do it in minimum number of operations.

Input : [15, 4, 15]
Output : 0
Array is already a palindrome. So we
do not need any merge operation.

Input : [1, 4, 5, 1]
Output : 1
We can make given array palindrome with
minimum one merging (merging 4 and 5 to
make 9)

Input : [11, 14, 15, 99]
Output : 3
We need to merge all elements to make
a palindrome.

[deepanjali19]

Hello @smoholkar I would like to work on this!

I would create a PR soon.