Background: In an effort to start documenting my development as a programmer, I am going to be uploading my solutions to various problems from the problem solving website rosalind.info. The theme of most of these problems will be geared towards bioinformatics and biology, mostly because I think the field is cool and I want to become a neuroscientist or neuro-engineer one day. The problems will get progressively more difficult but it is my hope that my solutions remain consistently easy to understand and follow
Problem description:
Problem A string is simply an ordered collection of symbols selected from some alphabet and formed into a word; the length of a string is the number of symbols that it contains.
An example of a length 21 DNA string (whose alphabet contains the symbols 'A', 'C', 'G', and 'T') is "ATGCTTCAGAAAGGTCTTACG."
Given: A DNA string s of length at most 1000 nt.
Return: Four integers (separated by spaces) counting the respective number of times that the symbols 'A', 'C', 'G', and 'T' occur in s.
Sample Dataset AGCTTTTCATTCTGACTGCAACGGGCAATATGTCTCTGTGTGGATTAAAAAAAGAGTGTCTGATAGCAGC Sample Output 20 12 17 21