The process took a grotesquely long time to begin with. Originally, a recruiter reached out to me about interviewing with them, so I applied to one position.

Getting the phone screen even scheduled took weeks because the recruiter was so unresponsive. After the phone screen, it took 3 weeks to get any feedback. It turned out that they thought I'd be a better fit for a different position than I applied for, but that position wasn't open yet, and the recruiter didn't bother to tell me in a reasonable amount of time.

A few months later, they reached out to me again to tell me that the position opened up and they wanted me to interview for it, so I accepted.

When I finally did the in-person interview, most of the people I spoke with were friendly, except for one of the coding module interviewers, who was pretty rude. He was 10 minutes late and was looking at his laptop, obviously doing something else while I was coding my answer to his question. It was very clear that he was totally disinterested in doing the interview.

The other coding module interviewer was nice and personable, but asked a question that had a shaky basis to begin with, and the interviewer's answer to the question was just totally wrong.

Given an array of integers, write a function that will produce a random permutation of the input array.

Given an unordered binary tree and any two distinct nodes in the tree, find their common ancestor.

Given two linked lists that could potentially have a merge—i.e., at some point during one of the linked lists, the next node is a node in the other list—write an algorithm that determines if two lists merge or not. The lists could also potentially contain a cycle—i.e., an element can loop back around to the head.