I received a referral and spoke with a contact at a career fair. This led to an on-campus interview for an Applications Developer position. I was hesitant about this role because it exclusively involved developing in their proprietary language. I informed the interviewer of my reservations and, a few weeks later, a recruiter contacted me regarding my referral.

This new opportunity was for an intern position on the tooling team. I scheduled an interview with a senior manager. The manager called me late for our scheduled interview, requiring me to email the recruiters beforehand to inquire about his impending call. The interview itself was adequate, though the manager appeared largely disinterested throughout the conversation. After the approximately 20-minute interview concluded, I received an email about two weeks later requesting a final technical phone interview.

The final technical phone interview was conducted by a software engineer. It began with trivia questions about Java, followed by a coding problem that was to be solved verbally, without actual coding. I felt I performed well during this section, but apparently, my performance was not sufficient.

Approximately 1.5 weeks later, I heard back from the recruiter with news that no offer would be extended.

How do you find if a linked list has a loop in it?

Given K sorted integer arrays, each filled on average with N elements, how do you find a minimal span of numbers that contains at least one number from each array (inclusive of the boundaries)?