I received a referral and an email a few days later about moving forward. However, the process took around a month because my recruiter left his job. The transition was not smooth, and I followed up many times until someone helped me. It was a month and a half since I received the first email when I interviewed.

The experience wasn't great. The problem I was given was really easy, and I solved it pretty quickly with no bugs. My solution was optimal, and the interviewer told me it worked and he was happy with it, but I still got rejected after a few days.

Given two sorted lists, return a list of their intersection with no duplicates, using O(1) space and O(n) run time.

For example:

A = [2, 3, 3, 4, 6, 6, 8] B = [3, 3, 6, 7, 9]

should return [3, 6].