Code !!!!!!!!!! ' The K factor of a string is defined as the number of times 'abba' appears as a substring. Given two numbers `length` and `k_factor`, find the number of strings of length `length` with 'K factor' = `k_factor`. The algorithms is as follows: dp[length][k_factor] will be a 4 element array, wherein each element can be the number of strings of length `length` and 'K factor' = `k_factor` which belong to the criteria represented by that index: - dp[length][k_factor][0] can be the number of strings of length `length` and K-factor = `k_factor` which end with substring 'a' - dp[length][k_factor][1] can be the number of strings of length `length` and K-factor = `k_factor` which end with substring 'ab' - dp[length][k_factor][2] can be the number of strings of length `length` and K-factor = `k_factor` which end with substring 'abb' - dp[length][k_factor][3] can be the number of strings of `length` and K-factor = `k_factor` which end with anything other than the above substrings (anything other than 'a' 'ab' 'abb') Example inputs length=4 k_factor=1 no of strings = 1 length=7 k_factor=1 no of strings = 70302 length=10 k_factor=2 no of strings = 74357.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Code !!!!!!!!!!

'
The K factor of a string is defined as the number of times 'abba' appears as a
substring. Given two numbers `length` and `k_factor`, find the number of
strings of length `length` with 'K factor' = `k_factor`.

The algorithms is as follows:

dp[length][k_factor] will be a 4 element array, wherein each element can be the
number of strings of length `length` and 'K factor' = `k_factor` which belong
to the criteria represented by that index:

- dp[length][k_factor][0] can be the number of strings of length `length`
and K-factor = `k_factor` which end with substring 'a'

- dp[length][k_factor][1] can be the number of strings of length `length`
and K-factor = `k_factor` which end with substring 'ab'

- dp[length][k_factor][2] can be the number of strings of length `length`
and K-factor = `k_factor` which end with substring 'abb'

- dp[length][k_factor][3] can be the number of strings of `length` and
K-factor = `k_factor` which end with anything other than the above
substrings (anything other than 'a' 'ab' 'abb')

Example inputs

length=4 k_factor=1 no of strings = 1
length=7 k_factor=1 no of strings = 70302
length=10 k_factor=2 no of strings = 74357.

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions