I found an old challenge that should be fun to revisit. This challenge was from a friend of mine (his post) but he is no longer a member here so I will post his words below instead of trying to find a link to his post. I found this in one of my old files with the description and my entry into the challenge (I will post my entry later).
As usual, please post your solution in any language but please add comments to your code so other people can learn from your solution.
*** Cornbread ***
Given the array { 1, 9, -6, 5, -9, 3, 2, -7, 4, -5, 8, -2, 6}
Write the most efficient function you can which returns the sum of the largest possible sub array value and that sub arrays start and end indexes. The array may not be re-ordered it must stay as is. This can be solved in O(n) or in regular language: a single pass over each element of the array.
This should test your algorithm writing abilities not your ability to use your favorite language.
*** Cornbread ***