Leetcode 1937

Coding question asked in Google interviews.

'''
input       dp input[j]+max(LTR[j],RTL[j])      LeftToRight(max(dp[j], do[j-1]-1))     RightToLeft max(dp[j], dp[j+1]-1)    
1,2,3           1,2,3                                   2,7,4                                   2,7,4
1,5,1           2,7,4                                   2,7,6…