Bloomberg LP Interview Report
- 0of 0 votes
AnswersFind the maximum subsequence sum of an array of integers which contains both positive and negative numbers and return the starting and ending indices within the array.
- kcoder December 18, 2009
For example:
int array[] = {1, -2, -3, 4, 5, 7, -6}
The max subsquence sum is 4+5+7= 16 and start index is at 3 and end index is at 5.| Report Duplicate | Flag | PURGE
Bloomberg LP Yahoo Software Engineer / Developer Algorithm - 0of 0 votes
AnswersA linked list has a loop.
- kcoder December 18, 2009
Find the kth node from the end of the loop.
For example:
head -> 1 -> 2-> 3-> 4-> 5
|_______|
Find the 2nd node from the end of the loop which is node 5.| Report Duplicate | Flag | PURGE
Bloomberg LP Software Engineer / Developer Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.