Onsite:
1. Testing this model.
Seller or Publisher <==> AppNexus Sever <==> Buyers or Bidder
The highest bidder wins and he/she only need to pay by the second highest bidding + .01, how to test this policy? ( consider all of the cases the policy may fail, for example, all bidding are same, etc )
2. Algorithm.
Give a set of numbers, check if there is a subset whose summation is equal to a given number.
First give the idea of your algorithm and then test it. Second, review a solution to this problem and look for bugs. Different from the class DFS, this solution is divide-and-conquer. For example, check (1, 3, 5 ) -> 6 will be divided to check ( 3, 5 ) -> 5.