NUMBER FOLLOWING PATTERN

CodeChefOpen on judge ↗

Given a pattern containing only I's and D's. I for increasing and D for decreasing. Devise an algorithm to print the minimum number following that pattern. Digits from 1-9 and digits can't repeat. Input: The first line of input contains an integer T denoting the number of test cases. The first line of each test case is a string, which contains only I's and D's in capital letter. Output:

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