Say you are given
int a[ ] = {1,2,3,4}; int b[ ] = {4,3,2,1}; int S = 5;
Now the task is to find all pairs of two number which adds up to S (One number from a and other number from b).
You have a 2D matrix. Only two ZEROs in matrix. Find the path from 1st zero to 2nd zero with least sum.
1 6 8 9 0 3 4 9 -5 5 11 13 8 9 44 23 15 -20 7 9 7 -13 14 11 0 16 23 31 16 7 67 5 4 23 21 19
Answer
1 6 8 9 0 ----> 3 | 4 9 -5 5 11 13 | 8 9 44 23 15 -20 | 7 <---- 9 <---- 7 <--- -13 <--- 14 <--- 11 | 0 16 23 31 16 7 67 5 4 23 21 19
What is the simples way to check if the sum of two unsigned integers has resulted in an overflow.
Divide the array in two subarrays of n/2 sizes each such that the difference of the sum of two subsets is as minimum as possible. If n is even, then sizes of two subarray must be n/2 and if n is odd, then size of one subarray must be (n-1)/2 and size of other subset must be (n+1)/2.
