All hard algorithm questions. don't care about what you did before:
Ask for blessing....
===================================
1) Find missing number
A file contains 2^40 32-bit integers,
Given 15MB memory. Which which number is missing.
2) Target coins
Given a list of coins such as 25, 10, 5, 1
find the minimum number of coins for a target value such as 95.
3) Extended dictionary lookup
boolean arewords(char *words)
For example:
catdog, catsdog: both return TRUE
catzdog: return FALSE
4) How to allocate memory and how to access int **ptr;
5) Find a telephone number from text.
(backtracking).
6) Network design problem
A bunch of computers are connected in a line, each node
can send a msg to left/right, find a design for each node
to find out how many nodes are connected.
7) Shortest time to cross a bridge
A 10
B 3
C 2
D 1
each time only 2 persons can go, one of them
must come back to return the light.
