| about | help | code help+videos | done | prefs |
SubSequence of non-repeating chars Given a string, find the length of the longest substring without repeating characters. For example: - For “ABDEFGABEF”, the longest substring are “BDEFGA” and “DEFGAB”, length 6. - For “BBBB” the longest substring is “B”, with length 1. noRepeatSubSeq("abcabcbb") → 3 noRepeatSubSeq("antidisestablishmentarianism") → 11 noRepeatSubSeq("Bumfuzzle") → 4 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 299
Copyright Nick Parlante 2017 - privacy