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.
i guess below approach should work :
1.sort in decending order
2. move the first/next element to the team A and next +1 to team B
3. move the next element to team B nad next + 1 to team A
4 . repear step 2 and 3 till the list exhausted .
this should give almost nearest answer .
say the given set is {25,24,15,9,2,1} team A {25,9 , 2 } team b {24,15,1}
but to optimise our result we can further process our teams
find the avg of all the skill level , total skill level /2 . ( lets call this avg )
get the smallest set ( in case of odd )
try to replace the each element by the elements in other set and find the diff between the skil set and avg if it lesser than the earlier diff swap teh elements else replce with next element
diff* -> absolute value ignoring the sign of the result .
if you iterate above step you can attain the optimum result .
Please note you can also do it by just dividing the given set into two sets and just process by above algorithm . (if you sort and divide you will be doin the lesser swap while processing )
- ganapathydselva October 17, 2013