You are not logged in. Please login at to post your questions!


Super two letter string - DP Problem

asked 19 Mar '18, 13:49

brijwasi1995's gravatar image

accept rate: 11%

Let dp[i][j] be the number of number of two letter strings which satisfy the given constraints which are of length i and last character is j. if(j==0) the last character is Y , if (j==1) the last character is X;

Now base case is dp[1][0]=1 and dp[1][1]=0;

//calculating for length>1

           for(int i=2;i<=N;i++){

    dp[i][0]=dp[i][1]=0;// initializing to 0;

            //for 'Y' the previous can be anything so adding those values

    for(int j=1;j<P;j++){




return (dp[N][0]+dp[N][1])%mod;


answered 19 Mar '18, 14:36

beginner_1111's gravatar image

accept rate: 13%

edited 19 Mar '18, 14:40

Can you please explain the approach ? I mean, can you explain how to identify the states of dynamic programming required here ?

(19 Mar '18, 14:47) brijwasi19952★

The states here are length of the string and last character used for the length, length can go upto N and last character is either X or Y, so two states one is of length N and other of 2. Now to fill the table I have commented in the code .

(19 Mar '18, 14:56) beginner_11114★
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 19 Mar '18, 13:49

question was seen: 511 times

last updated: 19 Mar '18, 15:13