The interview experience was awful. The interviewer had a strong accent and it was very hard to understand. The majority of the interview was spent on understanding the questions.
Total Sum -->
Input: arr1 = [1,2,3,5], arr2 = [1,10,13,11], target = 15
Output: True ( 5 (from arr1) + 10(from arr2) == 15(target))
I solved this question and told him both brute force as well as an optimized solution.
Flatten Singly Linked List (Just next and child attributes)--> Similar to this question https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/
I told him multiple solutions with O(n) space complexity, but he insisted on O(1) space complexity.
I had very little time to think about space optimized solution as the majority of the time was wasted in clarifying the questions asked by the interviewer. Two days after the interview, I got rejection mail from them.
I hope this helps and All the Best