Associated Course(s):
Sudo Placement 2019

You are given an array A of size N. Your task is to find the minimum number of operations needed to convert the given array to 'Palindromic Array'.

Palindromic Array:

[23,15,23] is a ‘Palindromic Array’ but [2,0,1] is not.

The only allowed operation is that you can merge two adjacent elements in the array and replace them with their sum.

**Input**:

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is N, where N is the size of array.

The second line of each test case contains N space separated integers which is the input for the array.

**Output:**

Output the minimum number of operations required to make the given array a palindromic array.

**Constraints**:

1<=T<=100

1<=N<=100

**Example**:

**Input:**

2

5

3 2 3 3 5

4

5 3 3 4

**Output:**

1

3

**Explanation**:

For Test Case 1: [3 2 3 3 5] after merging the 1st two elements 3 and 2, we get the array as [5 3 3 5] which is a palindrome, hence only 1 operation is needed.

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

narahc321 | 170 |

agness | 163 |

lonecoder | 153 |

2016uec1342 | 142 |

HuHu | 140 |

lonecoder | 1088 |

nikhil_sojan | 1082 |

KshatriyaYash | 1066 |

mazumderrohit8 | 928 |

SumitSingh27 | 832 |

blackshadows | 5327 |

Ibrahim Nash | 5215 |

akhayrutdinov | 5111 |

mb1973 | 4504 |

Quandray | 4444 |

Login to report an issue on this page.