Hacker Rank: 2D Array - DS Solution

I've been trying to solve the puzzles on HackerRank.com lately. This post is just to solve the problem in Arrays section of Hacker Rank

I feel better to solve the problems though. It certainly improves some area in programming language.

As I'm a C# developer the problem is solved using C# as programming language.

Question: https://www.hackerrank.com/challenges/2d-array

And the solution is

	public class ArrayTwoD
	{
	static void Main(string[] args)
	{
	int[][] arr = new int[6][];
	for (int arr_i = 0; arr_i < 6; arr_i++)
	{
	string[] arr_temp = Console.ReadLine().Split(' ');
	arr[arr_i] = Array.ConvertAll(arr_temp, Int32.Parse);
	}
	var results = new List<int>();
	for (int i = 0; i < 4; i++) //number of iterations of arr
	{
	var firstRow = arr[i];
	var secondRow = arr[i + 1];
	var thirdRow = arr[i + 2];
	for (int j = 0; j < 4; j++) //no. of iterations for each hour glass
	{
	var sum = 0;
	for (int hourglass = (j + 2); hourglass >= j; hourglass--)
	{
	sum = sum + firstRow[hourglass] + thirdRow[hourglass];
	}
	var k = j + 1;
	sum += secondRow[k];
	results.Add(sum);
	}
	}
	Console.WriteLine(results.Max());
	}
	}

view raw ArrayTwoD.cs hosted with ❤ by GitHub