Count Number of Texts| Leetcode 2266 | Dynamic Programming| Live coding session

preview_player
Показать описание
Here is the solution to "Count Number of Texts" leetcode question. Hope you have a great time going through it.

🎉 Chapters
0:00 Introduction
1:30 Building the algoritm
11:30 Coding it up Solution

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

👉 Solutions

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series: 🔥🔥🔥

🔥🔥🔥 Leetcode Monthly Contest Playlist

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

never thought of this! I tried to derive dp[4] from previous and got tripped. thank you!!!

shrimpo
Автор

Crystal clear explanation bro, thank you ! 🔥

MrHotfish
Автор

Nice sunchit Sr for explaining every states as well this helped in knowing how actually dp is getting applied
waiting for such worthy explanation until now
now totally able to get it into my head
Thanks❤

sagarbora
Автор

Nice one as usual.. i really like your explanation .. I've a dumb question here -- why are we doing the modulus operation and how did we arrive at that mod value ?

rajeshg
Автор

confused for the dp[4] while solving but you explanation gave me a clear picture and thanks for the explanation

deepakchowdary
Автор

great i thought in direction of MCM dp but if we do in MCM dp there will be lot of repetitions, therefore tribonacci sequence works

yourbestie
Автор

This was hard according to me. A hour worth of pen, paper solved this for me pheww

vivekjaiswar
Автор

While considering We replace it with c only can't it be "aaa" Like all possible string of "222" that can be for the Great explanation!!!!.

utsavgupta
Автор

In the second if statement shouldn't the condition be (i>=3 && s.charAt(i-3)==ch && s.charAt(i-2)==ch)?

OmPrakash-otnr
visit shbcf.ru