3. Longest Substring Without Repeating Characters #42
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
tokuhirat
reviewed
Oct 4, 2025
| visited_char_to_index[str[right]] = right | ||
| end | ||
| max_size | ||
| end |
There was a problem hiding this comment.
良いと思いました。visited_char_to_index は難しいところですが、どういうインデックスかを説明する
char_to_last_index や char_to_last_seen_index もありかもしれません。やや長いので微妙でしょうか。
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.
解いた問題
3. Longest Substring Without Repeating Characters
使用言語
Ruby
次に解く問題
209. Minimum Size Subarray Sum