Resume Q&A + Insert Delete GetRandom O(1), Global/Local Inversions, DP array problem -- offer

I got interviewed for SDE internship at Zomato.

The interviewer asked few questions from my resume and then the following questions:

https://leetcode.com/problems/insert-delete-getrandom-o1/
https://leetcode.com/problems/global-and-local-inversions/

Next question was a DP based medium level question. It was something like this: There is an array P of prices of N objects, where Pi denotes the price of the i'th object. You have to sell those objects, but you can pick the object either from left end or right end. The profit earned on selling the object on k'th day is k times the price of object. Find the maximum profit you can get.

Waiting for the result.

Update: Got the offer.