Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 535 |

@akashverma4 | 291 |

@swastik8750 | 237 |

@nishunishuraj18 | 223 |

@nayan2709 | 211 |

@ajaybhardwaj1999 | 196 |

@surajmamgai | 193 |

@AnshikaPandey | 192 |

@gurshehzadsingh | 188 |

@shardul08 | 185 |

@Rajpra786 | 181 |

Complete Leaderboard |

Given a string **s** consists of lower case English alphabets or digits. The task is to replace each occurrence of digit with **'*'** or **'@'** or **'!'**. The task is to print all possible distinct strings in lexicographical order with space separation.

**Note:** ASCII value of **'!'** less than **'*'** and ASCII value of **'*'** is less than **'@'**

**Input: **

1. The first line of the input contains a single integer* * **T** denoting the number of test cases. The description of **T** test cases follows.

2. The first line of each test case contains a string **s.**

**Output:** For each test case, print all possible distinct strings in lexicographical order with space separation

**Constraints:**

1. 1 <= T <= 3

2. 1<= size of string <= 10

**Example:
Input:**

2

a1b2

abcdef

**Output:**

a!b! a!b* a!b@ a*b! a*b* a*b@ a@b! a@b* a@b@

abcdef

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Digit Combination

...