Harsh and his objects
CodeChefOpen on judge ↗
Harsh has two stacks of objects. Each object is denoted by an upper case letter. He is wondering what is the lexicographically smallest sequence of objects that can be made using the two stacks. He can take an object only from the top of the stack. Also, He wants to use all the objects available. Input Input description. The first line contains the number of test cases, T . Every next two lines
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.
Sign in to chat with the tutor and save your progress.
Sign in to start