Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Asymptotically faster solution for 17.23 (Max Square Matrix) #243

Open
wants to merge 3 commits into
base: master
Choose a base branch
from

Conversation

Qualtagh
Copy link

@Qualtagh Qualtagh commented Dec 5, 2022

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:

  • an implementation of an alternative algorithm with better asymptotics for a task 17.23 - O(N2 * log N)
  • (kind of) unit tests
  • and a markdown file with thorough explanation of the approach. You can view it here.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant