समस्या
Build an RNA string by replacing every DNA character with its partner. Use this complete mapping: A → U, C → G, G → C, T → A. Preserve the original order. No biology knowledge is needed.
Implement dna_to_rna(dna).
Input
dna: The DNA string to transform.
Output
Return the transformed string. Empty input returns an empty string.
सीमाएँ
0 ≤ DNA length ≤ 100,000. Characters are uppercase A, C, G, or T.
उदाहरण
इनपुट:
dna = "ACGT"
अपेक्षित आउटपुट:
expected = "UGCA"
इनपुट:
std::string dna = "ACGT";
अपेक्षित आउटपुट:
std::string expected = "UGCA";
इनपुट:
string dna = "ACGT";
अपेक्षित आउटपुट:
string expected = "UGCA";
व्याख्या
A becomes U, C becomes G, G becomes C, and T becomes A, giving UGCA.
इनपुट:
dna = ""
अपेक्षित आउटपुट:
expected = ""
इनपुट:
std::string dna = "";
अपेक्षित आउटपुट:
std::string expected = "";
इनपुट:
string dna = "";
अपेक्षित आउटपुट:
string expected = "";
व्याख्या
There are no characters to replace, so the result is empty.
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।