Two questions:
Q1: Leetcode easy -- Given an array of integers and integer A, find the integer in the array that is closest to A
Q2: Leetcode Hard+ -- I got a variation of this question https://leetcode.com/problems/meeting-rooms-iii/description/, except it was even harder. I never seen that leetcode question before, and so was really struggling. It's the first interview where I couldn't even come up with a remotely good solution. Totally bombed it.
I'm not sure why there's a drastic difference between the 2 parts lol.
Reject.
Comments (1)


