- Notifications
You must be signed in to change notification settings - Fork2.4k
Clarify log Time Complexity ForSearch 2d Matrix (LC 74)#3755
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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Merged
neetcode-gh merged 1 commit intoneetcode-gh:mainfromreywilliams:reywilliams/clarify-2d-bsearch-log-time-compNov 29, 2024
Merged
Clarify log Time Complexity ForSearch 2d Matrix (LC 74)#3755
neetcode-gh merged 1 commit intoneetcode-gh:mainfromreywilliams:reywilliams/clarify-2d-bsearch-log-time-compNov 29, 2024
Uh oh!
There was an error while loading.Please reload this page.
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 freeto join this conversation on GitHub. Already have an account?Sign in to comment
Labels
None yet
2 participants
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.
mdI wanted to clarify that$O(\log m + \log n)$ reduces to$O(\log(m * n))$ as this is the same time complexity as the
Binary Search (One Pass)approach. This might help in evaluating which to use during an interview.