Just appeared for OA of groupon 2 questions both DP.

1. Maxmize Value:- 2 arrays are given articles(e.x [2,2,3,4]) and values(e.x [3,2,4,5]) and max no of pages that can be read in a day is also as input lets say 9 for e.x. Each article's value is counted ony when that article is read twice. Given all this maxmise the value.(Tried Solving using knapsack logic wasn't able to pass all test cases).

2. Looked like a variation of stock span problem. Given an array of stock prices on each day calculate the max change in prices.
   [7,1,3,4,5] ans would be 5-1 = 4 (Solved by maintaining a variable of minm value and changing it if another smaller value appears)

Hope it helps someone !!

Update:- Cleared OA and was called for Tech Interview 1

Tech Interview 1:- Absolutely bombed this round 2 questions were asked:-

1. https://leetcode.com/problems/reverse-nodes-in-k-group/
2. https://leetcode.com/problems/subarray-sum-equals-k/

Verdict:- Rejected