using System;
public class Program
{
public static void Main()
/*
Given a matrix (a x a) with elements, write an algorithm that returns a printed list of each distinct element found in the diagonal of the matrix and the number of times they are displayed,
sorted by the highest rate of appearance. NOTE: Just consider the elements that are in the diagonals.
Here is the matrix declaration as a two-dimensional array in C#:
char[,] array = new char[5,5]()
{'a', 'b', 'c', 'd', 'e'},
{'d', 'a', 'e', 'f', 'f'},
{'c', 'a', 'e', 'f', 'f'},
{'e', 'a', 'e', 'e', 'f'},
{'a', 'a', 'e', 'f', 'a'}
};
Example of the result expected:
- Element "a" appears 5 times
- Element "e" appears 3 times
- Element "f" appears 1 times.
*/
Console.WriteLine("Hello World");
}