The interview process involved:

• Three phone interviews:
  • Two technical and one interpersonal with the hiring manager.

First phone interview technical question: Write a binary search tree class in C, implementing insertion, deletion, and search functions.

Second phone interview technical question: Implement a clipping algorithm in pseudocode that could handle more clip windows than were supported in hardware.

Third phone interview: Featured a number of personal and moral questions.

After passing the phone interviews, I proceeded to the on-site interview, which included:

• Writing my own implementation of tail in C.
• Writing a C algorithm to determine if a point lay within any polygonal bounding area.
• Writing a function to print any UTF string in reverse.

This was followed by a lunch interview, where I could ask questions about the company, and then a personal interview with HR and the hiring manager.

Definitely the point contained within the bounding polygon.

Was expecting to be asked a question about a point bound in a rectangle, but not bound by any polygon.