## Leetcode38

## Example,

Input: 4

Output: “1211”

Explanation: “1” -> “11” -> “21” -> “1211”; add the count of numeric character infront and repeat for n times

## Solution 1: Store the count and number for n times

time complexiity: O(n)

space complexity: O(n)

runtime: 36 ms | faster than 38.86% submissions

memory: 15 MB

1 | def countAndSay(self, n: int) -> str: |

## Today,

I did two easy questions that don’t look easy to me. #stillproudofmyself