1. Recruiter Screening
2. Technical Phone Interview
3. Four 1-hour rounds of technical interviews.

The in-person interviewers are nice enough, but a few of the folks I met maintained an aura of superiority.

One of the interviewers grilled me, seriously grilled me, on if I was even an eligible candidate due to an NDA, even after I told him it was a non-issue. I thought when I went in to the interview that I would be proving that I was technically capable and talking about my experience, but I got pulled sideways by an obvious microaggression. This wasted time that could have gone towards the coding portion of his hour.

Anyways, I do believe he made up his mind before we even spoke. I also believe individual interviewers all cast a vote, and you need them to vote unanimously, or you're not considered.

Provided a node of a graph, write a method that returns true if you can go from a source node to a destination node in x hops. The edges are directional, and there may be 0-many edges from one node to another. For example, I may have the following edges: a->b, a->b, b->c, c->a (so there are two edges from a to b). Can I go from a to b in 4 hops?