Suggested problems

Biological Motivation

Bandar Slot Hoki88 – Setiap orang yang pernah mengunjungi wisata kasino di dunia seperti Las Vegas, Macau, Genting dan lain-lain. Pasti tahu kalau permainan yang paling terlihat dan banyak adalah permainan slot. Mesin slot selalu dijajarkan di main hall casino dengan angka jackpot luar biasa. https://bandarslothoki88.com/

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