SEH_LENGE_THODA's blog

Help Needed in CSES Shortest Subsequence Problem
By SEH_LENGE_THODA, history, 3 years ago, In English

Can anyone suggest me how to solve this problem(https://cses.fi/problemset/task/1087)

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.

Constraints 1≤n≤1e6 Example

Input: ACGTACGT

Output: AAA

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (3)
| Write comment?
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by SEH_LENGE_THODA (previous revision, new revision, compare).

→ Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by SEH_LENGE_THODA (previous revision, new revision, compare).

→ Reply
»
12 months ago, # |
  Vote: I like it -9 Vote: I do not like it

you can modelled this problem as graph and can start thinking further

→ Reply