Abbreviation Using Backtracking

medium
1. You are given a word.
2. You have to generate all abbrevations of that word.

Use recursion as suggested in question video

Input Format

A string representing a word

Output Format

Check the sample ouput and question video.

Constraints

1 <= length of string <= 32

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
pep
Output
pep
pe1
p1p
p2
1ep
1e1
2p
3
Previous
N Queens - Branch And Bound
Next
Nqueens Permutations - 2d As 1d - Queen Chooses

Related Questions