public static int[][] horizontalSums(int[][] a, int sumToFind)
{

int[][] b= new int[a.length][a.length];
int row=0;
do
{
int sum = 0; //reset the sum for each row
int col = 0;
do
{
sum+=a[row][col];
b[row][col]=a[row][col];
if(sum >= sumToFind)
{
return b;
}
col++; //move to the next col
} while(col<a.length); //stop if we're at the end of the row (max col reached)
row++; //move to the next row
} while(row<a.length); //stop if there are no more rows left

return b;
//you got to the end and the sum was never reached... return some value telling you that!



}

int[] createRow(int[] row, int magicnum){
start = 0;
last = 0;
int[] newarray = new int[row.length]; // set to all zeros

// start with the first element
sum = row[0];
if (sum == magicnum){
// the sums meet our magic number. copy to new array
newarray[from start to last] = row[from start to last]
// move our start pointer over
} else if (sum > magicnum){
// we're too high. drop the left-most value by shifting over 1
} else if (sum < magicnum){
// we're not high enough. extend our right-most value by shifting over 1
}

// if our left pointer is passed our right pointer, increment our right pointer
// if right pointer is past the array, we're done
// recalculate sum
// repeat

return newarray;
}