Flipkart Interview Question for SDE-2s


Country: India
Interview Type: Phone Interview




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

I have just followed the approach of finding a window of size n with minimum difference between last and first elements.(Assuming the array is sorted). Kindly correct if I am wrong.
void distribute(int a[],int size,int n)
{
int min = -1;
int end = 0;
int j =0;
int start = 0;
int i = 0;
for(i = 0;i< size-n;i++)
{
j = i + n -1;
if(a[end]-a[i]<min)
{
min = a[j]-a[i];
start = i;
end = j;
}
}
for(i = start;i<=end;i++)
cout<<a[i];

}

- AJ May 16, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

sorry My bad, Please ignore previous comment.

- Manku July 14, 2015 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

What do i have to find in this question? Can you please explain a little? How come the answer is 3,4?

- Rahul June 14, 2015 | 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