Let’s solve a medium problem together on Leetcode.com: Count and Say
The count-and-say sequence is a sequence of digit strings defined by the recursive formula:
countAndSay(1) = "1"
countAndSay(n)is the way you would "say" the digit string from
countAndSay(n-1), which is then converted into a different digit string.