Minimum Meeting room problem steps: - sort the array by start - define a rooms array that will contain the ends of meeting - loop through the array one and at each iteration find out if there exist an end that is less than the start of the current iteration - if it exists then replace that end with the end you just found in the array and break the rooms loop. - else just add the current end to the room list - Can attend all meetings problem: - Sort the array by start - loop through if you find that M[i].end > M[i+1].start then return false if you dont find anything return true

The key in these questions is to cover the fundamentals, and be ready for the back-and-forth with the interviewer. Might be worth doing a mock interview with one of the Facebook or ex-Facebook IOS Developer experts on Prepfully? They give real-world practice and guidance, which is pretty helpful. prepfully.com/practice-interviews