using System;

using System.Collections.Generic;

​

namespace Aitheon.Interview

{

​

public class Program

{

public static void Main()

{

//var source = new int[] { 4, 3, 4, 4 };

//var destination = new int[] { 2,6,8};

​

//var source = new int[] { 20, 16, 33, 11 };

//var destination = new int[] { 5, -7, 6 };

​

var source = new int[] { 4, 3, 4, 4 };

var destination = new int[] { 2,6,8};

​

var computeInstance = IntegerArrayCompute.GetInstance(source, destination);

var result = computeInstance.Compute();

PrintComputeResult(result);

}

​

private static void PrintComputeResult(int[] result)

{

Console.WriteLine(string.Join(',', result));

}

​

}

​

public interface IArrayCompute

{

int[] Compute();

}

​

public class IntegerArrayCompute: IArrayCompute

{

​

Stack<int> Result;

Stack<int> Source;

Stack<int> Destination;

​

private IntegerArrayCompute()

{

Source = new Stack<int>();

Destination = new Stack<int>();

Result = new Stack<int>();

}

​

private IntegerArrayCompute(Stack<int> source, Stack<int> destination)

{

Source = source;

Destination = destination;

Result = new Stack<int>();

}

​

public static IntegerArrayCompute GetInstance(int[] source, int[] destination)

{

if(source == null)

{

throw new Exception("Missing source");

}

if (destination == null) {

throw new Exception("Missing Destination");

}

var numberOfElementsInSource = source.Length;

var numberOfElementsInDestination = destination.Length;

​

return new IntegerArrayCompute(GetInputArrayAsStack(source, Math.Max(numberOfElementsInSource, numberOfElementsInDestination) - numberOfElementsInSource),

GetInputArrayAsStack(destination, Math.Max(numberOfElementsInSource, numberOfElementsInDestination) - numberOfElementsInDestination));

}

​

private static Stack<int> GetInputArrayAsStack(int[] elements, int numberOfZeroesToPrePopulate)

{

var stack = new Stack<int>();

for (int i = 0; i < numberOfZeroesToPrePopulate; i++)

{

stack.Push(0);

}

foreach (var element in elements)

{

stack.Push(element);

}

return stack;

}

​

public int[] Compute()

{

int numberOfIterations = Source.Count

, carryOver = 0

, operationResult = Int32.MinValue

, index = 0;

​

​

for(; index < numberOfIterations -1; index++)

{

operationResult = PerformCompute(Source.Pop(), Destination.Pop(), index, carryOver);

carryOver = operationResult / 10;

var valueToStore = operationResult % 10;

Result.Push(valueToStore);

}

Result.Push(PerformCompute(Source.Pop(), Destination.Pop(), index, carryOver));

return Result.ToArray();

}

​

private int PerformCompute(int source, int destination, int index, int carryOver) {

if(index % 2 == 0)

{

return source + carryOver - destination;

}

else

{

return source + carryOver + destination;

}

}

}

}// by- Sri Ram Manoj Kambhampat