forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice lasa_drills_01 > LASA_dnaInversion
prev  |  next  |  chance

Description: Given an String str, made up only of the 4 letters of DNA (A, G, C, and T), return an array of strings where every A is replaced with a G and vice versa and all C's and T's are removed entirely. Hint: Remember to loop through the original String to find the length of the array with only 'G's and 'A's

LASA_dnaInversion("AGCT") → ["G", "A"]
LASA_dnaInversion("AG") → ["G", "A"]
LASA_dnaInversion("") → []

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

String[] LASA_dnaInversion(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

Copyright Nick Parlante 2017 - privacy