Suggested problems

Biological Motivation

https://www.mpescort.com">Mp Escort service https://www.mpescort.com/bhopal-escorts-call-girls-service-in-bhopal.html">Bhopal Call Girls service https://www.mpescort.com/gwalior-escorts-call-girls-service-in-gwalior.html">Gwalior Call Girl service https://www.mpescort.com/mathura-escorts-call-girls-service-in-mathura.html">Mathura Escort service https://www.mpescort.com/indore-escorts-call-girls-service-in-indore.html">Indore Escort service https://www.mpescort.com/jabalpur-escorts-call-girls-service-in-jabalpur.html">Jabalpur Escort service https://www.mpescort.com/ujjain-escorts-call-girls-service-in-ujjain.html">Ujjain Escort service

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