Minimum Number of Merges to make Palindrome

Problem Statement

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

Pattern:

---

Solution

public int minMerges(int[] nums) {  
   int merges = 0;  
   int start = 0, end = nums.length - 1;  
   while (start <= end) {  
      if (nums[start] < nums[end]) {  
         start++;  
         nums[start] += nums[start - 1];  
         merges++;  
      } else if (nums[end] < nums[start]) {  
         end--;  
         nums[end] += nums[end + 1];  
         merges++;  
      } else {  
         start++;  
         end--;  
      }  
   }   return merges;  
}

Notes