"Tower of Hanoi" is famous task. It has simple recursive solution.

Today I'll show how to find a loop in linked list in linear time.

Some interview question can be soled by dynamic programming. One of such is coin problem - express
an amount of money with minimal coin number.

Another interesting task for interview is "Longest substring without repeating characters".

Usual task for interview: Print all possible n pairs of balanced parentheses.