Q1: similar to question 1 in this post:
https://leetcode.com/discuss/interview-question/4508854/IBM-Online-Assessment-Backend-Engineer
except instead of votes they passed in cost as a parameter and wanted the highest rated restaraunt whose estimated cost was at most cost. Then find the one with the highest rating. If there's a tiebreaker based on rating, break it via the smaller estimated cost

Q2: given 2 tables of contacts and calls, find get the name(first and last), type(incoming or outgoing) and duration of the 3 longest calls(incoming and outgoing). So together there would be 6.