# Suggested problems

## Problem

Aug. 2, 2022, 1:35 a.m. by MarjoryNikolaus

## Biological Motivation

A string is just an ordered list of symbols from some alphabet that are put together to make a word. A string's length is the number of symbols it has.

An example of a DNA string with the letters A, C, G, and T in its alphabet is ATGCTTCAGAAAGGTCTTACG.

Given: A DNA string that has no more than 1000 nucleotides

Returns four numbers that show how many times the letters A, C, G, and T appear in s.

gartic phone drawing game and playable with a lot of friends, have you heard

## 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