Q1: LeetCode 88: Merge Sorted Array (the lengths of the arrays were not given, just the arrays)
I stumbled a bit on calculating the number of elements in nums1 because the lengths were not given. It did not occur to me immediately that elements in nums1 = nums1.size() - nums2.size(). The interviewer gave a small hint mentioning the usage of length of nums2. Recovered quickly, solved using O(n) time and O(1) space.

Q2: Leetcode 973: K Closest Points to Origin
I immediately mentioned the priority queue solution with the time complexities. Was asked if there is a better way. Mentioned Quicksort with time complexities. Was asked to code the priority Q solution. Had some missing bracket related typos which the interviewer pointer out.

Finished both in 35 mins. Was hoping for a positive result but got an update saying there wasn't enough signal to move formward :(
Dissapointed in myself because it feels like I got easy mediums and somehow I still bombed the phone screen. All that effort for a quick reject.