Asymptotically faster solution for 17.23 (Max Square Matrix)#243
Open
Qualtagh wants to merge 3 commits intocareercup:masterfrom
Open
Asymptotically faster solution for 17.23 (Max Square Matrix)#243Qualtagh wants to merge 3 commits intocareercup:masterfrom
17.23 (Max Square Matrix)#243Qualtagh wants to merge 3 commits intocareercup:masterfrom
Conversation
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Hello!
The book is a real masterpiece. It helped me to understand a lot of algorithmic techniques. Inspired by it, I tried to continue improving some algorithms staying in the same vein of interview format - the solution should be short, simple to understand, readable and limited to using previously explained algorithms/data structures.
I hope it may help somebody by giving some ideas.
The commit contains:
17.23- O(N2 * log N)