Skip to content
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

Merged
merged 11 commits into from
Oct 25, 2024
Merged

Conversation

Chiefpatwal
Copy link
Contributor

@Chiefpatwal Chiefpatwal commented Oct 25, 2024

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

@codecov-commenter
Copy link

codecov-commenter commented Oct 25, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 69.07%. Comparing base (135fb08) to head (3ed19a4).

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.
📢 Have feedback on the report? Share it here.

@Chiefpatwal
Copy link
Contributor Author

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.

@Chiefpatwal Chiefpatwal marked this pull request as ready for review October 25, 2024 18:25
@siriak siriak enabled auto-merge (squash) October 25, 2024 20:15
@siriak siriak merged commit 0f1dcbe into TheAlgorithms:master Oct 25, 2024
6 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants