Shortest Subsequence

CSESAdditional Problems IOpen on judge ↗

You are given a DNA sequence consisting of characters A, C, G, and T. Your task is to find the shortest DNA sequence that is not a subsequence of the original sequence. Input The only input line contains a DNA sequence with n characters. Output Print the shortest DNA sequence that is not a subsequence of the original sequence. If there are several solutions, you may print any of them. Constr

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI