I was contacted by a recruiter on LinkedIn.

I had an initial phone screen with the recruiter.

Next, there was a 45-minute phone screen with a developer, which required coding in Google Docs.

I was then invited onsite for a full day of interviews.

This included five onsite interviews, all requiring whiteboard coding, and lunch with a developer.

Given an array, find a continuous subarray which equals a particular sum.

Given a tree (not a BST or a binary tree) which has a value at each node, find all continuous paths which sum to a target value.

Given a sentence, remove all tokens from it if the reverse of that token occurs previously in it.

Example: "The cat and rat tac tar" becomes "the cat and rat".