Exploring all paths , by removing leftmost and rightmost element and selecting the maximum value
return current_sum + max ( maxScore ( l + 1 , r , prefix_sum , num + 1 ) , maxScore ( l , r - 1 , prefix_sum , num + 1 ) ) ; NEW_LINE