IBM Interview Question for Software Engineer / Developers






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

I can give a solution O(n*Sum) but not O(k*n)

- Anonymous August 30, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Why dont you explain it?

- iaintgeek September 22, 2010 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

Problem can be solved by Dynamic Programming. Think in terms of knapsack problem where total_sum / 2 is the target.

- dexter February 20, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Runs in O(n)

vector<int> s1;
	vector<int> s2;
	int sum1 = 0;
	int sum2 = 0;

	int s[] = {-1,-2,3,2,5,-6,-6,-2,-1,-2};

	for(int i = 0; i < 10; ++i) {
		if(abs(sum1 - sum2 + s[i]) < abs(sum1 - sum2 - s[i])) {
			s1.push_back(s[i]);
			sum1 += s[i];
		}
		else{
			s2.push_back(s[i]);
			sum2 += s[i];
		}
	}

- Alexandre September 07, 2017 | 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