American Express OA Question 2024 May | Dynamic Programming | on-campus

Question: Decode Ways Problem Statement A message containing letters from A-Z can be encoded into numbers using the following mapping: 'A' -> "1", 'B' -> "2", ... 'Z' -> "26" To decode an encoded message, all the digits must be grouped and then mapped back into letters using the reverse of the mapping above. Given a string s containing only digits, return the number of ways to decode it. If there are no valid ways to decode the string, return ...