Repository navigation
Add interview pattern guides to six algorithm notes - #32
Merged
Merged
Conversation
…ing and sorting notes Each note was checked against the common LeetCode problems in its area. The missing patterns are now explained in short sections, every major technique starts with a "First step" box, and each note ends with a "Reading the Problem Statement" table that maps problem wording to code decisions. Existing content is kept; one misleading sentence about cycle detection in the topological sort section was reworded. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Use \log and \sqrt commands, escape set braces inside display math, and remove padded dollar delimiters that some renderers skip. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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
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.
This PR makes the notes more useful for someone who is about to solve LeetCode-style problems. Each of the six notes was compared against roughly the 30 most common LeetCode problems in its area, and the patterns that were missing or only mentioned in passing now have their own short sections.
Three kinds of additions appear in every note:
What changed in each note:
Existing text is kept. The only edit to old content is one sentence in topological sort that implied Kahn's algorithm needs separate cycle detection; it now says Kahn detects cycles through the output count.
All new code blocks were run against brute-force answers on random inputs, and the math passes the website's TeX validator.
🤖 Generated with Claude Code