Anibel - Edges - Matrix Checksum

[anibelamerica]

Time complexity: O(n^2) where n is the length of the column or row of the input matrix (square matrix). This is because the algorithm iterates through each value in the matrix to get the sum for that column/row and then additionally compares the stored hash of 2*n values to return a boolean: O(n^2 + 2*n) but since 2*n is less significant than n^2, we can drop that value from the time complexity.

Space complexity: O(n) where n is the same as above. We end up using 2 hashes of size n but drop the constant in Big O notation.

[shrutivanw]

Nice work on the algorithm!

The problem statement encourages you to minimize the space complexity as much as possible. With that in mind, can you think of further optimizations to your algorithm? After you have given it some thought, tally your new algorithm to mine here: https://github.com/Ada-C10/matrix_check_sum/blob/solution/lib/matrix_check_sum.rb