|All-time Popular Problems|
|Delete without head pointer|
|Check if a number is power of another number|
|Array to BST|
|Implement Queue using Linked List|
|Lowest Common Ancestor in a BST|
|Reverse a Linked List in groups of given size.|
|Print all nodes that don’t have sibling|
|Equal to product|
Given an integer n your task is to complete the function convertToRoman which prints the corresponding roman number of n .
The first line of each test case contains the no of test cases T. Then T test cases follow. Each test case contains a single integer n.
For each test case in a new line output will be the roman number representation of n.