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


Warmup-2 > stringYak
prev  |  next  |  chance

Suppose the string "yak" is unlucky. Given a string, return a version where all the "yak" are removed, but the "a" can be any char. The "yak" strings will not overlap.

stringYak("yakpak") → "pak"
stringYak("pakyak") → "pak"
stringYak("yak123ya") → "123ya"

...Save, Compile, Run (ctrl-enter)

public String stringYak(String str) { }

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: 236.0

Copyright Nick Parlante 2017 - privacy