Easiest Problem

CodeChefOpen on judge ↗

You have to find lexicographically smallest string of length n of lowercase english alphabets. Input First line of input contains a single integer T, denoting number of test cases. T lines follow each containing a single integer N Output For each test case output the required string Constraints - 1 ≤ T ≤ 100 - 1 ≤ N ≤ 1000 Example Input: 1 1 Output: a Explanation Example case 1. a

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