Honest Sort

CodeChefOpen on judge ↗

### Problem Statement Given a list of words, sort them lexicographically (i.e in dictionary order) ### Input - First line will contain, T, the number of test cases. - For each test case, there are two inputs. The first line has the number of strings to be sorted, $n$. - Then, $n$ lines follow, each having one string. ### Output For each test, output each word on a new line after sorting. ##

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