Java Program to Generate N Number of Passwords of Length M Each

This is the java program to generate N passwords each of length M given by the user. The number of passwords, N, returned doesn’t exceed M!.

Here is the source code of the Java Program to Generate N Number of Passwords of Length M Each. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

//This is sample program to generate N passwords of length M, where N < M!
import java.util.Random;
import java.util.Scanner;
 
public class N_Password_M_Length 
{
    static void permute(int []a, int k)
    {
        if(k==a.length)
        {
            for(int i=0; i<a.length; i++)
            {
                System.out.print(a[i]);
            }
            System.out.println();	
        }
        else
        {
            for (int i = k; i<a.length; i++) 
            {
                int temp=a[k];
                a[k]=a[i];
                a[i]=temp;
 
                permute(a,k+1);
 
                temp=a[k];
                a[k]=a[i];
                a[i]=temp;
            }
        }	
 
    }
    public static void main(String args[])
    {
        System.out.println("Enter the length of the password: ");
        Scanner input = new Scanner(System.in);
        int m = input.nextInt();
        Random random = new Random();
        int []a = new int[m];
        for(int i=0; i<m; i++)
        {
            a[i] = random.nextInt(10);
        }
 
        System.out.println("The Possible Passwords are: ");
        N_Password_M_Length.permute(a, 0);
 
        input.close();
    }
}

Output:

$ javac N_Password_M_Length.java
$ java N_Password_M_Length
 
Enter the length of the password: 
5
The Passwords are: 
31210
31201
31120
31102
31012
31021
32110
32101
32110
32101
32011
32011
31210
31201
31120
31102
31012
31021
30211
30211
30121
30112
30112
30121
13210
13201
13120
13102
13012
13021
12310
12301
12130
12103
12013
12031
11230
11203
11320
11302
11032
11023
10213
10231
10123
10132
10312
10321
21310
21301
21130
21103
21013
21031
23110
23101
23110
23101
23011
23011
21310
21301
21130
21103
21013
21031
20311
20311
20131
20113
20113
20131
11230
11203
11320
11302
11032
11023
12130
12103
12310
12301
12031
12013
13210
13201
13120
13102
13012
13021
10231
10213
10321
10312
10132
10123
01213
01231
01123
01132
01312
01321
02113
02131
02113
02131
02311
02311
01213
01231
01123
01132
01312
01321
03211
03211
03121
03112
03112
03121

Related posts:

Adding Shutdown Hooks for JVM Applications
Java Program to Check whether Directed Graph is Connected using DFS
Multipart Upload with HttpClient 4
A Guide To UDP In Java
Server-Sent Events in Spring
Spring Boot - Web Socket
Java Program to Implement Best-First Search
Lớp Collections trong Java (Collections Utility Class)
Java Program to implement Sparse Vector
A Quick Guide to Spring MVC Matrix Variables
Java Program to Create the Prufer Code for a Tree
Cachable Static Assets with Spring MVC
Java Program to Show the Duality Transformation of Line and Point
Check if a String is a Palindrome in Java
Reading an HTTP Response Body as a String in Java
How to Get All Spring-Managed Beans?
Tổng quan về ngôn ngữ lập trình java
Java Program to Check the Connectivity of Graph Using DFS
Java Program to Generate a Graph for a Given Fixed Degree Sequence
Java Program to Implement Segment Tree
Converting Java Date to OffsetDateTime
More Jackson Annotations
Guide to System.gc()
JUnit 5 for Kotlin Developers
Java Program to Implement IdentityHashMap API
Hướng dẫn Java Design Pattern – Service Locator
Java Stream Filter with Lambda Expression
Java Program to Generate All Possible Combinations of a Given List of Numbers
Java Program to Implement Sorted Circular Doubly Linked List
Tạo ứng dụng Java RESTful Client với thư viện OkHttp
Java Program to Generate All Possible Subsets with Exactly k Elements in Each Subset
Java Program to Implement the Checksum Method for Small String Messages and Detect