


The first line of input contains an integer ‘T’ denoting the number of test cases.
Each of the next ‘T’ lines contains a single integer ‘num’.
For each test case, return a string/character array that is the word form of the given number ‘num’.
1. In every two consecutive words, there must be a space.
2. All the characters of the word must be English lower letter.
3. The return type must be a string.
4. You are not required to print the output explicitly, it has already been taken care of. Just implement the function and return the word.
1 <= T <= 10^5
0 <= N <= 9999
Time limit: 1 sec
The basic idea is that we convert every word according to the given number’s digit, basically, the range of number is‘0’ to ‘9999’ so we have to consider at max 4-digits numbers. Idea is that store all the parts in different arrays. One array will store single digits. One for number ‘10’ to ‘19’ another one store multiples of ‘10’.
Pair Product Div by K
Pair Product Div by K
Merge Two Sorted Arrays Without Extra Space
Merge Two Sorted Arrays Without Extra Space
Co-Prime
First Digit One
Special Digit Numbers