Given two binary trees, p and q, return True if they are the same, that is, if all values are the same and False otherwise.
Partition a linked list given a value x as a pivot element so that all nodes that are
smaller than x come before all nodes that are greater or equal than x. The original
order of the elements should be retained.
Rotate a singly-linked list at k elements from their end.
Remove duplicate items from a linked list completely, including the original item.
Marcus Kazmierczak has great photos of the Silicon Valley on his homepage. Definitely worth checking them out.