bryce.hulett@hotmail.com > sequence
prev  |  next  |  chance

/** * @param word consisting only of letters A-Z or a-z * @return all subsequences of word, separated by commas, * where a subsequence is a string of letters found in word * in the same order that they appear in word. */ sequence("abc") → "abc, ab, ac, a, bc, b, c, " sequence("it") → "it, i, t, " sequence("d") → "d, " Go...Save, Compile, Run (ctrl-enter)Show Hint public String sequence(String s) { } Go Editor font size %:75100125150 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

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 400 Post-solution available

Copyright Nick Parlante 2017 - privacy