Given a single stranded DNA string, compute how many times each nucleotide occurs in the string.
The genetic language of every living thing on the planet is DNA. DNA is a large molecule that is built from an extremely long sequence of individual elements called nucleotides. 4 types exist in DNA and these differ only slightly and can be represented as the following symbols: ‘A’ for adenine, ‘C’ for cytosine, ‘G’ for guanine, and ‘T’ thymine.
Here is an analogy:
Make sure you have read the Installing and Running the Tests pages for C++ on exercism.io. This covers the basic information on setting up the development environment expected by the exercises.
Get the first test compiling, linking and passing by following the three rules of test-driven development. Create just enough structure by declaring namespaces, functions, classes, etc., to satisfy any compiler errors and get the test to fail. Then write just enough code to get the test to pass. Once you’ve done that, uncomment the next test by moving the following line past the next test.
#if defined(EXERCISM_RUN_ALL_TESTS)
This may result in compile errors as new constructs may be invoked that you haven’t yet declared or defined. Again, fix the compile errors minimally to get a failing test, then change the code minimally to pass the test, refactor your implementation for readability and expressiveness and then go on to the next test.
Try to use standard C++14 facilities in preference to writing your own low-level algorithms or facilities by hand. CppReference is a wiki reference to the C++ language and standard library. If you are new to C++, but have programmed in C, beware of C traps and pitfalls.
The Calculating DNA Nucleotides_problem at Rosalind http://rosalind.info/problems/dna/
It’s possible to submit an incomplete solution so you can see how others have completed the exercise.