Decode Message - Amazon Top Interview Questions
Problem Statement :
Given the mapping "a" = 1, "b" = 2, ... "z" = 26, and an encoded message message (as a string), count the number of ways it can be decoded. Constraints n ≤ 100,000 where n is the length of message Example 1 Input message = "111" Output 3 Explanation This can be decoded 3 ways: aaa, ak, and ka. Example 2 Input message = "8" Output 1 Explanation This can be only decoded one way, as h. Example 3 Input message = "12" Output 2 Explanation This can be decoded 2 ways: ab or l. Example 4 Input message = "60" Output 0 Explanation There's no way to decode this message. Example 5 Input message = "0012" Output 0
Solution :
Solution in C++ :
int solve(string s) {
int n = s.size();
long int dp[n + 1];
memset(dp, 0, sizeof(dp));
if (s[0] != '0') dp[1] = 1;
dp[0] = 1;
for (int i = 2; i <= n; i++) {
if (s[i - 1] > '0') dp[i] = dp[i - 1];
if (s[i - 2] == '1' || (s[i - 2] == '2' && s[i - 1] <= '6')) dp[i] += dp[i - 2];
}
return dp[n];
}
Solution in Python :
class Solution:
def solve(self, message):
if not message:
return 0
dp = [0 for x in range(len(message) + 1)]
dp[0] = 1
dp[1] = 0 if message[0] == "0" else 1
for i in range(2, len(message) + 1):
if 0 < int(message[i - 1 : i]) <= 9:
dp[i] += dp[i - 1]
if 10 <= int(message[i - 2 : i]) <= 26:
dp[i] += dp[i - 2]
return dp[len(message)]
View More Similar Problems
2D Array-DS
Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t
View Solution →Dynamic Array
Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.
View Solution →Left Rotation
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d
View Solution →Sparse Arrays
There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun
View Solution →Array Manipulation
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu
View Solution →Print the Elements of a Linked List
This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode
View Solution →