**Problem :** Given a number k, find a k-digit string where the product of its digits is greater than or equal to the sum of its digits. If there are multiple such strings, return the one with the minimum product. If there are still ties, return the lexicographically smallest string.↵
↵
↵
**Testcases:**↵
↵
Input : 1↵
Output : 1↵
↵
Input : 2↵
Output : 22↵
↵
Input : 3↵
Output : 123↵
↵
Input : 4↵
Output : 1124↵
↵
Input : 5↵
Output : 11222↵
↵
Input : 6↵
Output : 111223126↵
↵
**Constraints:**↵
↵
1 <= K <= 100000↵
↵
How to solve this? Please help!
↵
↵
**Testcases:**↵
↵
Input : 1↵
Output : 1↵
↵
Input : 2↵
Output : 22↵
↵
Input : 3↵
Output : 123↵
↵
Input : 4↵
Output : 1124↵
↵
Input : 5↵
Output : 11222↵
↵
Input : 6↵
Output : 111
↵
**Constraints:**↵
↵
1 <= K <= 100000↵
↵
How to solve this? Please help!
