38. Count and Say - LeetCode Solution

preview_player
Показать описание
The count-and-say sequence is the sequence of integers with the first five terms as following:

1. 1
2. 11
3. 21
4. 1211
5. 111221
1 is read off as "one 1" or 11.
11 is read off as "two 1s" or 21.
21 is read off as "one 2, then one 1" or 1211.

Given an integer n where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence. You can do so recursively, in other words from the previous member read off the digits, counting the number of digits in groups of the same digit.

Note: Each term of the sequence of integers will be represented as a string.

--------------------------------------------------------------------------------------------------------------
Subscribe to my other Youtube channel for a peek in the life:
--------------------------------------------------------------------------------------------------------------
Follow my daily stories on Instagram:
--------------------------------------------------------------------------------------------------------------
Join me on:
--------------------------------------------------------------------------------------------------------------
Hi Everyone, I'm Rajdeep Kaur and I'm an ex-Amazon software engineer. As of now, I am working as a Software Engineer in Miro. I was hired directly from India to Europe (Netherlands).
I make videos on competitive programming, Data Structures and Algorithms and some tips to get hired.
Subscribe for the latest updates, I upload new videos almost everyday :) I hope my content helps you in getting your dream job.
  1. Game of Coders
  2. programming
  3. codinginterview
  4. array
  5. java
Рекомендации по теме
The Most Confusing 0:00:49

The Most Confusing FAANG Interview Question! | Count And Say - Leetcode 38

38. Count and 0:05:19

38. Count and Say - Day 18/31 Leetcode October Challenge

Count and Say 0:18:27

Count and Say | LeetCode 38 | Coding Interview Tutorial

Leetcode 38 Count 0:06:02

Leetcode 38 Count and Say | Coding Decoded SDE Sheet

Leetcode 38 ( 0:05:15

Leetcode 38 ( Count and Say)

LeetCode 38 Count 0:08:18

LeetCode 38 Count and Say

Count and Say 0:03:33

Count and Say Python Solution - LeetCode #38

Count and Say 0:16:28

Count and Say | Made Super Easy | Google | Explanation | Live Coding

Coding Interview Tutorial 0:06:40

Coding Interview Tutorial 28: Count and Say [LeetCode]

Count And Say 0:06:02

Count And Say [LeetCode 38] | Arrays | Approach and Intuition

Count and Say 0:07:53

Count and Say - Leetcode 38 - Java

Count and say 0:07:39

Count and say problem | Love Babbar DSA Sheet | Leetcode | Amazon | Google🔥

LeetCode: 38. Count 0:12:37

LeetCode: 38. Count and Say (Visualized)

38. Count and 0:10:14

38. Count and Say

LeetCode in C# 0:05:44

LeetCode in C# | 38. Count and Say

leetCode #38 Count 0:05:28

leetCode #38 Count and Say | JSer - algorithm and JavaScript

Leetcode 38: Count 0:16:01

Leetcode 38: Count and Say

Leetcode 38. Count 0:05:00

Leetcode 38. Count and Say Python TechZoo

38. Count and 0:07:43

38. Count and Say | LeetCode Daily Challenge | JavaScript

C++ leetcode 38. 0:00:13

C++ leetcode 38. Count and Say

38. Count and 0:00:17

38. Count and Say Python LeetCode Solution #leetcode #python #codingproblems #coding

LeetCode 38 Count 0:04:54

LeetCode 38 Count and Say

[Leetcode 38]Count And 0:07:38

[Leetcode 38]Count And Say

38. Count and 0:01:09

38. Count and Say - JavaScript - One Line

Комментарии
Автор

Your logic is good👌, but before going to code, please explain using an example so you'll get the idea of complexity, how it will be good and what approach we will use, just a suggestion🙏, keep it up 👍

amiteshsingh
Автор

time and space complexity O(n^2) and O(1) respectively ?

siddharthsahu