Repository navigation
docs(ko): translate longest increasing subsequence - #2253
Open
DongJinNam wants to merge 1 commit into
Open
DongJinNam wants to merge 1 commit into
DongJinNam wants to merge 1 commit into
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
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.
Adds a Korean translation of the longest increasing subsequence README, covering the definition, time complexity, examples, and references. The translation preserves the original example values and links, and makes it clear that a subsequence does not have to be contiguous and that multiple longest subsequences can exist.
Validation:
npm run lintnpm run coverage -- --runInBand— 178 test suites and 587 tests passed.