Layla - Edges - matrix sum #20
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Nice work! I encourage you to elaborate a little more while explaining the reasoning behind your time complexity. The problem statement encouraged you think of a solution that optimizes the space complexity as much as possible. With that in mind, can you think of how you may tweak your algorithm to optimize the space complexity further? Think more about it and then tally your solution with mine here: https://github.com/Ada-C10/matrix_check_sum/blob/solution/lib/matrix_check_sum.rb |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The time complexity is O(n squared) cause there are two nested loops. I think the space complexity is O(n).