Java Code to Count Possible Decoding Of A Given Digit Sequence

Possible decoding of a given digit sequence in Java

Count Possible Decoding Of A Given Digit Sequence in Java

Here we will discuss how to count all the possible decoding of a given digit sequence in Java. Before counting the number of decodings first let’s see how the numbers are assumed to be coded. The decoding programs are the most possible questions asked and are largely practiced in Java programming. The program counts the number of possible decoding’s of the entered digit by the user of the given sequence.

Explanation

1 = A, 2 = B, 3 = C, . . . . , 26 = Z.
The decoding programs are the most possible questions asked and are largely practiced in C  programming. The program counts the number of possible decoding’s of the entered digit by the user of the given sequence.
For example :- if the digit sequence is “12” then there are two possible decoding’s for this – One of them is ‘AB’ when we decode 1 as ‘A’ and 2 as ‘B’. Now we can also decode this digit sequence “12” as ‘L’ when we decode digits 1 and 2 taken together as an integer 12.

Now let’s take another example for reference,

Sequence = 131

  • Possible decoding (1, 3, 1,)    = ACA
  • Possible decoding (13, 1)   = MA
    So, the total possible decoding’s of sequence 131 is 2.

Algorithm

  • Initialize a array cnt of size 1 + length of input and store 1 at 0 & 1 position
  • Iterate from 2 to a using variable k
  • If the last digit not equal to 0, then last digit must added to the number of words if (dig[k-1] > ‘0’)
  • In case second last digit is smaller than 2 and last digit is smaller than 7, then last two digits form a valid character
  • Print cnt[a]
Count Possible Decoding java

Java code

Run
import java.io.*;

public class Main
{
    public static int cnt_decoding_digits(char[] dig, int a)
    {
        int cnt[] = new int[a+ 1];

        cnt[0] = 1;

        cnt[1] = 1;

        for (int k = 2; k <= a; k++) 
        { 
            cnt[k] = 0; 

            cnt[k] = cnt[k-1];

            if (dig[k-2] == '1' || (dig[k-2] == '2' && dig[k-1] < '7') )

                cnt[k] += cnt[k-2];
        }
        return cnt[a];
    }
    public static void main (String[] args)
    {
        String s="123";

        char[] dig= s.toCharArray();

        System.out.println(cnt_decoding_digits(dig, 3));
    }
}

Output

Enter the sequence : 123
Possible count of decoding of the sequence : 3

One comment on “Java Code to Count Possible Decoding Of A Given Digit Sequence”


  • 06_Animesh

    import java.util.*;
    import java.lang.*;
    import java.io.*;

    class Main
    {
    static List arr = new ArrayList();
    public static void main (String[] args) throws java.lang.Exception
    {
    // your code goes here
    try{
    //scanner class object creation
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    String str = Integer.toString(n);
    String output = “”;
    possibleCode(str.substring(1), output + str.charAt(0));
    System.out.println(arr.size()-1);
    }catch(Exception e){
    return;
    }
    }

    public static void possibleCode(String str, String output){
    if(str.length()==0){
    arr.add(output);
    return;
    }
    possibleCode(str.substring(1), output+ “_”+str.charAt(0));
    possibleCode(str.substring(1), output+str.charAt(0));
    return;
    }
    }