https://leetcode.com/problems/split-array-into-consecutive-subsequences\nThere is a `cards` array that contains `n` cards. Each card id is from 1 to 13. Consecutive (in terms of card ID, not array index) X cards make X-straight. For example 2-3-4 makes 3-straight. X should be at least 3. Is it possible to put all cards in straights? Each card will belong to one straight. Array is not necessarily sorted. Each card can appear multiple times.\n\n**Example 1:**\n```\nInput: cards = [2, 3, 4, 1, 2, 3, 4]\nOutput: true\nExplanation: 2-3-4 and 1-2-3-4. (3-straight and 4-straight).\n```\n\n**Example 2:**\n```\nInput: cards = [1, 2, 1, 2, 3]\nOutput: false\nExplanation: 1-2-3 is 3-straight, but 1-2 is 2-straight. We need at least 3-straight.\n```

https://leetcode.com/problems/split-array-into-consecutive-subsequences\nThere is a cards array that contains n cards. Each card id is from 1 to 13. Consecutive