Suggested problems

thanksgiving image hd 2019

Nov. 7, 2019, 6:24 a.m. by thanksgivingquotes

Biological Motivation

[https://thanksgivingpictures2019.com/][1] [https://thanksgivingpictures2019.com/thanksgiving-prayer-for-friends/][2] [https://thanksgivingpictures2019.com/best-thanksgiving-day-poems-for-friends-family-everyone/][3] [https://thanksgivingpictures2019.com/thanksgiving-images-wallpapers/][4] [https://thanksgivingpictures2019.com/best-thanksgiving-quotes-for-friends/][5]

[1]: https://thanksgivingpictures2019.com/best-thanksgiving-day-poems-for-friends-family-everyone/ [2]: https://thanksgivingpictures2019.com/best-thanksgiving-day-poems-for-friends-family-everyone/ [3]: https://thanksgivingpictures2019.com/best-thanksgiving-day-poems-for-friends-family-everyone/ [4]: https://thanksgivingpictures2019.com/thanksgiving-images-wallpapers/ [5]: https://thanksgivingpictures2019.com/best-thanksgiving-quotes-for-friends/

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