← All problemsSign in

Deleted Characters(keteki)

Given a string A and another string B, string A can be converted to string B, by deleting some characters from string A. Create another string C such that it contains the characters deleted from A, while converting string A to B, in increasing order of position in string A. Print the lexicographic-ally smallest string C possible. Print "-1", if it is not possible to convert string A to string B

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

Sign in to chat with the tutor and save your progress.

Sign in to start