CareerCup

var getFirstKElements = function (arr1, arr2, k) {
    var result = [];
    for (var i = 0; i < k; i++) {
        if (arr1[0] < arr2[0]) {
            result.push(arr1.shift());
        }
        else{
            result.push(arr2.shift());   
        }
    }
    return result;
}

public int binaryToInt(string binaryString)
{
	int convertedInt = 0;
	for (int i = binaryString.length; i > 0; i-- )
	{
		convertedInt += binaryString.charAt(i) == "1" ? 2^(binaryString.length - i) : 0;
	}
	return convertedInt;
}

public string binaryAddition(string one, string two)
{
	string binarySum = "";
	var sum = binaryToInt(one) + binaryToInt(two);
	while (sum > 0)
	{
		binarySum += sum % 2;
		sum = sum / 2;
	}
	return binarySum;
}

public static double calculatePayout(Member member) 
{
    double payout = member.getMonthlySales() * .1;
    double recruitSales = 0;
    Collection<Member> allRecruits = new Collection<Member>();
    while( !allRecruits.isEmpty() )
    {
         Member recruit = allRecruits.First();
         recruitSales += recruit.getMonthlySales();
         allRecruits.remove(recruit);
         allRecruits.AddRange(recruit.getRecruitedMembers());
    }
    return payout + (recruitSales * .04);
}

Would this be a worthy solution?

public class Bishop {
	public Bishop (int x, int y){
		this.x = x;
		this.y = y;
	}
	public boolean Move (int targetX, int targetY){
		int tmp1 = abs(this.x - this.y);
		int tmp 2 = abs(targetX - targetY);
		if (tmp1 % 2 != tmp2 % 2)
			return false;
		int moveX = CheckMovement(this.x, targetX);
		if (moveX == -1)
			return false;
		this.x = moveX;
		int moveY = CheckMovement(this.y, targetY);
		if (moveY == -1)
			return false;
		this.y = moveY;
		return true;
	}
	private int CheckMovement(int origin, int target){
		if (origin == target)
			return -1;
		else if (origin > target)
			return origin + 1;
		else if (origin < target)
			return origin - 1;
	}
}