Yahoo Interview Question for Software Engineer / Developers






Comment hidden because of low score. Click to expand.
1
of 1 vote

It seems to be the same as the Maximum Subsequence Sum problem

- K Kishore June 22, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

int i=0,max=0,diff=0;
loop i,arr
if(arr[min]<arr[i])
min=i;
int diff=arr[i]-arr[min];
if(diff>max)
{
buy=min;
sell=i;
max=diff;
}
end loop

- Mr.4342 July 10, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

use divide and conquer
1) divide in two arrays (keep doing this till size is two elements)
2) find max and min in both, there can be three cases
a) max and min on left
b)max and min on right
c)max and min on left and right

- keshav January 06, 2013 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More