Generate all the strings of length n from 0 to k-1.

Objective: Given two numbers, n and k (k>=n), write an algorithm to generate all the strings of length n drawn from 0 – k-1.

Example:

k = 2, n = 2
Output:  0 0      0 1         1 0         1 1

k = 3, n = 2
Output:
0 0          1 0        2 0        0 1         1 1         2 1          
0 2          1 2        2 2

Approach:

• This problem is similar to “Generate All Strings of n bits” with some modification.
• Recursion is the key here.
• Create integer array of size n.
• Traverse from 0 to k and put all the values from 0 to k at the last index in the array and make a recursive call to n-1.
• Print the array at the base case print the array but only for size n.
• See the code below for more understanding.

Run This Code

Java Code:

Output:

0 0
1 0
2 0
0 1
1 1
2 1
0 2
1 2
2 2

Also Read:

- Given an array, find all unique subsets with a given sum with allowed repeated digits. Medium
- Reverse a String using Recursion Beginner
- Print Left View of a given binary tree Medium
- Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium
- Convert BST to Greater Sum Tree Medium
- Given two binary trees, check if one binary tree is a subtree of another Medium
- Find the number of distinct Islands OR connected components. Hard
- Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard