Suggested problems

Best SEO service in bhubaneswar

Dec. 17, 2020, 12:03 p.m. by Reflekt Visual

Biological Motivation

Contact Reflekt Visual to get the [Best SEO service in Bhubaneswar][1], Web Design, web development, Mobile App Development, and Complete Digital Marketing service with 100% results. Call +91-8368604071 to get instant response and Auditing for your business.

[1]: https://www.reflektvisual.com/contact-us/

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