I got this question in microsoft interview recently. Can you help me solve this problem

Given an array of n coins and k picks, what is the maximum possible coins that you can pick for k times, given that you can either pick from start or end of the array

Example
coins: [4,5,2,1,3] k=2
ans : 9