id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

rmueller@lasacs.com > noRepeatSubSeq
prev  |  next  |  chance

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)

public int noRepeatSubSeq(String s) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 299

Copyright Nick Parlante 2017 - privacy