Company: Google_5july
Difficulty: medium
Palindrom special Problem Description A number X is said to be palindrome special, if it satisfies the given conditions: Every digit `d` present in X, occurs `d` number of times in X. Digits of X forms a palindrome i.e. it reads the same from right to left and left to right. You are given an integer N. Task: Determine the smallest palindrome special number greater than N. Complete the solve function provided in the editor. This function takes the following 1 parameters (an integer N) and returns the required answer. Input Format The first line contains a single integer T, which denotes the number of test cases. T also specifies the number of times you have to run the solve function on a different set of inputs. For each test case: The first line contains an integer N. Output Format For each test case in a new line, print the smallest palindrome special number greater than N. Examples Example 1: Input: N = 2 Output: 22 Explanation: 22 is the smallest palindrome special number greater th