Interview question ranking FizzBuzz (1), implementing malloc (10)
- by blrs
I'd like to have your opinion on the difficulty of the following interview question:
Find the subarray with maximum sum in an array of integers in O(n) time.
This trivial sounding problem was made famous by Jon Bentley in his Programming Pearls where he uses it to demonstrate algorithm design techniques.
On a scale of 1-10, 1 being the FizzBuzz…