FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2406,3  "name": "decode-the-message",4  "difficulty": "Easy",5  "link": "https://leetcode.com/problems/decode-the-message/",6  "date": "2022-06-26",7  "task_description": "You are given the strings `key` and `message`, which represent a cipher key and a secret message, respectively. The steps to decode `message` are as follows: Use the **first** appearance of all 26 lowercase English letters in `key` as the **order** of the substitution table. Align the substitution table with the regular English alphabet. Each letter in `message` is then **substituted** using the table. Spaces `' '` are transformed to themselves. For example, given `key = \"**hap**p**y** **bo**y\"` (actual key would have **at least one** instance of each letter in the alphabet), we have the partial substitution table of (`'h' -> 'a'`, `'a' -> 'b'`, `'p' -> 'c'`, `'y' -> 'd'`, `'b' -> 'e'`, `'o' -> 'f'`). Return _the decoded message_. **Example 1:** ``` **Input:** key = \"the quick brown fox jumps over the lazy dog\", message = \"vkbs bs t suepuv\" **Output:** \"this is a secret\" **Explanation:** The diagram above shows the substitution table. It is obtained by taking the first appearance of each letter in \"**the** **quick** **brown** **f**o**x** **j**u**mps** o**v**er the **lazy** **d**o**g**\". ``` **Example 2:** ``` **Input:** key = \"eljuxhpwnyrdgtqkviszcfmabo\", message = \"zwx hnfx lqantp mnoeius ycgk vcnjrdb\" **Output:** \"the five boxing wizards jump quickly\" **Explanation:** The diagram above shows the substitution table. It is obtained by taking the first appearance of each letter in \"**eljuxhpwnyrdgtqkviszcfmabo**\". ``` **Constraints:** `26 <= key.length <= 2000` `key` consists of lowercase English letters and `' '`. `key` contains every letter in the English alphabet (`'a'` to `'z'`) **at least once**. `1 <= message.length <= 2000` `message` consists of lowercase English letters and `' '`.",8  "test_case": [9    {10      "label": "Example 1",11      "input": "key = \"the quick brown fox jumps over the lazy dog\", message = \"vkbs bs t suepuv\"",12      "output": "\"this is a secret\" "13    },14    {15      "label": "Example 2",16      "input": "key = \"eljuxhpwnyrdgtqkviszcfmabo\", message = \"zwx hnfx lqantp mnoeius ycgk vcnjrdb\"",17      "output": "\"the five boxing wizards jump quickly\" "18    }19  ],20  "constraints": [21    "For example, given key = \"happy boy\" (actual key would have at least one instance of each letter in the alphabet), we have the partial substitution table of ('h' -> 'a', 'a' -> 'b', 'p' -> 'c', 'y' -> 'd', 'b' -> 'e', 'o' -> 'f').",22    "26 <= key.length <= 2000",23    "key consists of lowercase English letters and ' '.",24    "key contains every letter in the English alphabet ('a' to 'z') at least once.",25    "1 <= message.length <= 2000",26    "message consists of lowercase English letters and ' '."27  ],28  "python_template": "class Solution(object):\n    def decodeMessage(self, key, message):\n        \"\"\"\n        :type key: str\n        :type message: str\n        :rtype: str\n        \"\"\"\n        ",29  "java_template": "class Solution {\n    public String decodeMessage(String key, String message) {\n        \n    }\n}",30  "metadata": {31    "func_name": "decodeMessage"32  }33}