Long time, I know. I like this problem because I came across it in my actual day job and it fits so nicely for a good algo problem.
Given an array of integers A, return the index of the max value. If there are multiple indices with the same max val, return one of the indices equally randomly. ... (more)
Here's a question I encountered while studying for the Putnam.
Problem: The set S has 10 integers, each between 0 and 100. Prove that there are two disjoint subsets of S that have the same sum.
Solution: The number of nonempty subsets of S is 2^10 - 1 = 1023. The total sum of all of the integers is between 0 and 1000. Therefore, two of these subsets mus... (more)
Its been really long since I have posted anything. Better late than never though.
This problem has already featured on cseblog, though I found it on Page on Quantnet(nice site, you should try it).