-
Notifications
You must be signed in to change notification settings - Fork 19.9k
Add longest substring #6007
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
Add longest substring #6007
Conversation
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## master #6007 +/- ##
============================================
+ Coverage 69.05% 69.07% +0.01%
- Complexity 4663 4666 +3
============================================
Files 623 624 +1
Lines 17156 17166 +10
Branches 3309 3311 +2
============================================
+ Hits 11847 11857 +10
Misses 4855 4855
Partials 454 454 ☔ View full report in Codecov by Sentry. |
Longest Substring Without Repeating Characters This implementation utilizes the sliding window technique to efficiently find the length of the longest substring without repeating characters. The algorithm maintains a dynamic window that expands and contracts based on character uniqueness, ensuring optimal performance with a time complexity of O(n). This solution enhances our algorithm collection by addressing common string manipulation challenges, providing an essential tool for developers working with text processing. |
clang-format -i --style=file path/to/your/file.java