is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
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.
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.
/*Given an array consisting of N Numbers.
- cxy0224 August 26, 2015Divide it into two Equal(it is important) partitions such that difference between sum of both partitions is minimum.
If number of elements are odd difference in partition size can be at most 1.*/
package com.cxy.test;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Random;
public class TestOne {
public static void main(String[] args) {
/*Integer[] testArray = new Integer[10];;
for (int i =0;i<10;i++)
{
Random rn=new Random();
testArray[i]=rn.nextInt(100);
}*/
Integer[] testArray={1,2,3,6,8,9,7};
ArrayList<Integer> array1 = new ArrayList<Integer>();
ArrayList<Integer> array2 = new ArrayList<Integer>();
Arrays.sort(testArray, Collections.reverseOrder());
for (int i = 0; i < testArray.length/2; i++) {
array1.add(testArray[i]);
}
for (int i = testArray.length/2; i < testArray.length; i++) {
array2.add(testArray[i]);
}
int arrayDifference = sum(array1)-sum(array2);
if(arrayDifference !=0)
{
array1= new ArrayList<Integer>();
array2= new ArrayList<Integer>();
for (int i = 0; i < testArray.length; i++) {
if (i ==0) {
array1.add(testArray[i]);
}
else if (i==1) {
array2.add(testArray[i]);
}
else
{
int sum1=sum(array1);
int sum2=sum(array2);
if(i<=testArray.length-2 || testArray.length%2==1)
{
if(array1.size() - array2.size() >1)
{
array2.add(testArray[i]);
}
else if(array2.size() - array1.size() >1)
{
array1.add(testArray[i]);
}
else
{
if (sum1 <= sum2)
{
array1.add(testArray[i]);
}
else
{
array2.add(testArray[i]);
}
}
}
else
{
if(array1.size() - array2.size() ==1)
{
array2.add(testArray[i]);
}
else if(array2.size() - array1.size() ==1)
{
array1.add(testArray[i]);
}
}
}
}
}
System.out.println(Arrays.toString(testArray));
printList(array1);
System.out.println(sum(array1));
printList(array2);
System.out.println(sum(array2));
}
public static int sumArray(Integer[] tempArray) {
int sum = 0;
for (int i : tempArray)
sum += i;
return sum;
}
public static int sum(ArrayList<Integer> tempArrayList) {
int sum = 0;
for (Integer i : tempArrayList)
sum += i;
return sum;
}
public static void printList(ArrayList<Integer> list) {
String x = "";
for (Integer elem : list) {
x += elem + ",";
}
System.out.print(x+" | Sum is:");
}
}