Count and Say | LeetCode 38 | Coding Interview Tutorial

[@TerribleWhiteboard]

If there are any videos you'd like me to make or if you have any ideas on how to optimize this solution, let me know!

[@hennadiikasian4389]

Thanks for the explanation. I had never got the point of this problem, until I saw this video. You can see it from the problem description. This task has ~200 likes and ~7000 dislikes on Leetcode.

[@TerribleWhiteboard]

You're welcome! Yeah, it took me a while to understand the solution and I couldn't find an explanation anywhere.

[@pratiks29]

yes thats true, the description of this problem is actually the worst

[@reyou7]

Best of the best explanation. I think understanding the problem here is the biggest challenge than actually solving it.
Row 1: "1" (Base case)
Row 2: "11" (Previous has one 1s)
Row 3: "21" (Previous has two 1s)
Row 4: "1211" (Previous has one 2s and one 1s)
Row 5: "111221" (Previous has one 1s and one 2s and two 1s)
Row 6: "312211" (Previous had three 1s and two 2s and one 1s)

[@lingyundai964]

great explanation, the slower the clearer I personally feel

[@TerribleWhiteboard]

Thanks!

[@DS-Academy]

Thnaks Buddy, You did amazing!

[@TerribleWhiteboard]

Thanks!

[@amitbhattacharyya5925]

great explanation , i dint understand the question at first place

[@TerribleWhiteboard]

Thanks!

[@abigaillee9759]

Thank you so much!!! I watched so many videos but couldnt understand how to write the code. After watching yours I understand it now!

[@nora8200]

Best explanation for this question! Thank you for uploading!

[@TerribleWhiteboard]

Thanks!

[@quirkyquester]

amazing video, your video made it so clear and easy to understand, thank you so much! I really appreciate it!

[@TerribleWhiteboard]

You're welcome!

[@piyushupadhyay8361]

great explanation....!!! thanks

[@lingyundai964]

why are we decreasing n in the ned? I thought since the row is starting from the beginning so it should be increasing n?

[@TerribleWhiteboard]

It's just used to count the number of rows, and in this solution, I'm counting backwards from n to 1. When n is 1, I return the answer. I could have started from row 1 and counted up, but I did it the other way instead.

[@aymanibrahim1928]

very good explanation :+1

[@TerribleWhiteboard]

Thanks!

[@sergekov3804]

What app is that the one you use?

[@TerribleWhiteboard]

It's just the Notes app on the iPad and I draw using the Apple Pencil.

[@Shiva-zy7jq]

Great explanation. What is the time complexity for this problem?

[@sunidhihegde242]

could you code it in c++ ,it would be better to understand ,though the logic pretty clear .

[@shekbake4389]

good explanation

[@TerribleWhiteboard]

Thanks!

[@codingandmusical6542]

Great solution, what is the time complexity of this solution?

[@Turnpost2552]

lol damn 7516 poeple hate this question.

[@financewithsom485]

you explain fine but its a little boring

[@TerribleWhiteboard]

Thanks!

[@shadmanmartinpiyal4057]

// another solution, I guess faster
/**
* @param {number} n
* @return {string}
*/
var countAndSay = function (n) {
if (n === 1) return "1";
let finalResult = "1"
for (let i = 2; i