๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
def count_valid_strings(N):
    MOD = 10**9 + 7
   
    T, A, N, R, U, S = range(6)
   
    dp = [[0] * 6 for _ in range(N + 1)]
   
    dp[1][T] = 1
    dp[1][N] = 1
    dp[1][S] = 1
   
    for i in range(1, N):
        dp[i + 1][A] = (dp[i][T]) % MOD
        dp[i + 1][N] = (dp[i][A]) % MOD
        dp[i + 1][R] = (dp[i][A] + dp[i][N]) % MOD
        dp[i + 1][U] = (dp[i][R]) % MOD
        dp[i + 1][S] = (dp[i][U]) % MOD
        dp[i + 1][T] = (dp[i][S]) % MOD
        dp[i + 1][A] = (dp[i + 1][A] + dp[i][S]) % MOD
        dp[i + 1][N] = (dp[i + 1][N] + dp[i][S]) % MOD
        dp[i + 1][R] = (dp[i + 1][R] + dp[i][S]) % MOD
        dp[i + 1][U] = (dp[i + 1][U] + dp[i][S]) % MOD
   
    result = sum(dp[N][c] for c in [T, A, N, R, U, S]) % MOD
    return result


Thoughtwork โœ