<div> 🟡 2025-04-18 #string </div>The count-and-say sequence is a sequence of digit strings defined by the recursive formula:

<ul>
<li><code>countAndSay(1) = "1"</code></li>
<li><code>countAndSay(n)</code> is the run-length encoding of <code>countAndSay(n - 1)</code>.</li>
</ul>

<a href="http://en.wikipedia.org/wiki/Run-length_encoding" target="_blank">Run-length encoding</a> (RLE) is a string compression method that works by replacing consecutive identical characters (repeated 2 or more times) with the concatenation of the character and the number marking the count of the characters (length of the run). For example, to compress the string <code>"3322251"</code> we replace <code>"33"</code> with <code>"23"</code>, replace <code>"222"</code> with <code>"32"</code>, replace <code>"5"</code> with <code>"15"</code> and replace <code>"1"</code> with <code>"11"</code>. Thus the compressed string becomes <code>"23321511"</code>.

Given a positive integer <code>n</code>, return the <code>nth</code> element of the count-and-say sequence.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 4

Output: "1211"

Explanation:

<pre>countAndSay(1) = "1"
countAndSay(2) = RLE of "1" = "11"
countAndSay(3) = RLE of "11" = "21"
countAndSay(4) = RLE of "21" = "1211"
</pre>
</div>

Example 2:

<div class="example-block">
Input: n = 1

Output: "1"

Explanation:

This is the base case.
</div>

&nbsp;
Constraints:

<ul>
<li><code>1 &lt;= n &lt;= 30</code></li>
</ul>

&nbsp;
Follow up: Could you solve it iteratively?

🟡 2025-04-18 
 #string 

The count-and-say sequence is a sequence of digit strings defined by the recursive formula:
countAndSay(1) = "1"
countAndSay(n) is the run-length encoding of countAndSay(n - 1).
Run-length encoding (RLE) is a string compression method that works by replacing consecutive identical characters (repeated 2 or more times) with the concatenation of the character and the number marking the count of the characters (length of the run). For example, to compress the string "3322251" we replace "33" with "23", replace "222" with "32", replace "5" with "15" and replace "1" with "11". Thus the compressed string becomes "23321511".
Given a positive integer n, return the nth element of the count-and-say sequence.
 
Example 1:
Input: n = 4
Output: "1211"
Explanation:
countAndSay(1) = "1"
countAndSay(2) = RLE of "1" = "11"
countAndSay(3) = RLE of "11" = "21"
countAndSay(4) = RLE of "21" = "1211"



Example 2:
Input: n = 1
Output: "1"
Explanation:
This is the base case.
 
Constraints:
1 <= n <= 30
 
Follow up: Could you solve it iteratively?

38.count-and-say