1,two sorted array. merge them to a sorted one.
2, input a unsigned int(32), output the strings of the number. eg. input: 9876, output: nine thousand eight hundred seventy six.
3, N integers. a number existed half times of N. find it. O(1) in space and O(n) in time.
I finished the first two. no time for the last one. Others seems all have finished the three.
It's tough for me, a EE, to survive in those guys in CS and SE.
I won't give up. This test do inspired me. It's a war which gives fun without fatality. Enjoy it.