Help me in this string problem. Solution need as soon as possible.

Question

You are given a string s. You need to find two non-empty strings a and b such that the following conditions are satisfied:

Strings a and b are both subsequences of s.
For each index i, character si of string s must belong to exactly one of strings a or b.
String a is lexicographically minimum possible; string b may be any possible string.
Given string s, print any valid a and b.

Answer 1

Where is your solution?

Answer 2

U r cheating in Ur exams

Answer 3

"Solution need as soon as possible."
Choice of multiple languages.
I think trying to cheat in an exam is the most charitable interpretation.

Answer 4

A͢J - S͟o͟l͟o͟H͟e͟l͟p͟e͟r͟ its in my pc. And I am trying

Answer 5

Jolen Mascarenhas not at all. Just stuck in the problem.