FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2444,3  "name": "longest-ideal-subsequence",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/longest-ideal-subsequence/",6  "date": "2022-07-31",7  "task_description": "You are given a string `s` consisting of lowercase letters and an integer `k`. We call a string `t` **ideal** if the following conditions are satisfied: `t` is a **subsequence** of the string `s`. The absolute difference in the alphabet order of every two **adjacent** letters in `t` is less than or equal to `k`. Return _the length of the **longest** ideal string_. A **subsequence** is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters. **Note** that the alphabet order is not cyclic. For example, the absolute difference in the alphabet order of `'a'` and `'z'` is `25`, not `1`. **Example 1:** ``` **Input:** s = \"acfgbd\", k = 2 **Output:** 4 **Explanation:** The longest ideal string is \"acbd\". The length of this string is 4, so 4 is returned. Note that \"acfgbd\" is not ideal because 'c' and 'f' have a difference of 3 in alphabet order. ``` **Example 2:** ``` **Input:** s = \"abcd\", k = 3 **Output:** 4 **Explanation:** The longest ideal string is \"abcd\". The length of this string is 4, so 4 is returned. ``` **Constraints:** `1 <= s.length <= 105` `0 <= k <= 25` `s` consists of lowercase English letters.",8  "test_case": [9    {10      "label": "Example 1",11      "input": "s = \"acfgbd\", k = 2",12      "output": "4 "13    },14    {15      "label": "Example 2",16      "input": "s = \"abcd\", k = 3",17      "output": "4 "18    }19  ],20  "constraints": [21    "t is a subsequence of the string s.",22    "The absolute difference in the alphabet order of every two adjacent letters in t is less than or equal to k.",23    "1 <= s.length <= 105",24    "0 <= k <= 25",25    "s consists of lowercase English letters."26  ],27  "python_template": "class Solution(object):\n    def longestIdealString(self, s, k):\n        \"\"\"\n        :type s: str\n        :type k: int\n        :rtype: int\n        \"\"\"\n        ",28  "java_template": "class Solution {\n    public int longestIdealString(String s, int k) {\n        \n    }\n}",29  "metadata": {30    "func_name": "longestIdealString"31  }32}