Retired
Longest non-repeating character sequence (retired)
Description:
Given a string, find the length of the longest substring without any repeating characters.
See if you can solve it in linear complexity!
Examples:
abcda should return 4
abacbe should return 4
abrkaabcdefghijjxxx should return 10
Algorithms
Similar Kata:
Stats:
| Created | Apr 30, 2020 |
| Warriors Trained | 11 |
| Total Skips | 0 |
| Total Code Submissions | 15 |
| Total Times Completed | 7 |
| Python Completions | 7 |
| Total Stars | 0 |
| % of votes with a positive feedback rating | 10% of 5 |
| Total "Very Satisfied" Votes | 0 |
| Total "Somewhat Satisfied" Votes | 1 |
| Total "Not Satisfied" Votes | 4 |
| Total Rank Assessments | 5 |
| Average Assessed Rank | 7 kyu |
| Highest Assessed Rank | 5 kyu |
| Lowest Assessed Rank | 8 kyu |
