Suggested problems

piciona.blogspot.com/2013/04/

Oct. 5, 2021, 6:38 a.m. by robin smithsters

Biological Motivation

Click on https://piciona.blogspot.com/2013/04/jaffjeff_17.html">[this article][1], an interesting read and a must know information for everyone.

[1]: http://piciona.blogspot.com/2013/04/jaffjeff_17.html

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 an DNA string (whose alphabet contains the symbols A, C, G, and T) is ATGCTTCAGAAAGGTCTTACG.

Given: A DNA string $s$ of length at most 1000 nucleotides.

Return: Four integers corresponding to the number of times that the symbols A, C, G, and T occur in $s$.

Sample Dataset

AGCTTTTCATTCTGACTGCAACGGGCAATATGTCTCTGTGTGGATTAAAAAAAGAGTGTCTGATAGCAGC

Sample Output

20 12 17 21