Interview Verified
Salesforce FutureForce AI Challenge 2026 - get maximum opportunity sum
given a m x n matrix with values
in one operation:
1. you can select one row
2. remove either first element or last element from the row
if you remove first element, then second element becomes the first
we can perform these operations exactly k times
we have to maximize the sum of removed elements and print the sum
1<= n, m <= 100
1<= mat[i][j] <= 1e5
1<= k <= min(2000, m*n)