soweigel@smsd.org ap-comp-sci > stringDisect
prev  |  next  |  chance

Create an array of strings by disecting each word into pairs of letters. If a single letter is left, add just that letter to the array. Return the array. stringDisect("Geometry") → ["Ge", "om", "et", "ry"] stringDisect("SM South Raiders") → ["SM", " S", "ou", "th", " R", "ai", "de", "rs"] stringDisect("section") → ["se", "ct", "io", "n"] Go...Save, Compile, Run (ctrl-enter)Show Hint public String[] stringDisect(String word) } 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: 200 Post-solution available

Copyright Nick Parlante 2017 - privacy