Hey everyone,

Hope you all are doing great. This blog is just to get your attention towards a series of beginner level training session videos that I have started making on youtube. I just wanted to try something different rather than traditional algo teaching. So got the idea of picking up some problems in the range of 1000-1700 and covering each type of problem in each session so that along with teaching Ill also be able to maintain my practice. Currently I have finished recording two sessions and have uploaded them on youtube. Language used: Hindi+English.

Link to youtube channel

Please let me know if I am doing anything wrong or if you have any suggestions for me. Open to any and all reviews.

Over and out. PS: Subscribe if you want me to keep going!:)

I have had this doubt in dynamic programming for a long time now regarding which states to use. The question goes something like this:

Reading Input:

Recursion Code: So from the basic intuition I wrote this code. Which is obviously MLE:

Then I tried this code:

And this code passed the test cases and got AC. So now coming back to my doubt. There have been many problems where

$$$ dp[i][j][k] --> $$$ is optimized to $$$--> dp[i][j] $$$ because the state j is always changing. But I have also practiced questions where trying this $$$ dp[i][j][k] --> $$$ is optimized to this --> $$$ dp[i][j] $$$ and it got me a WA.

So can someone please explain when to take a state into consideration so that I dont fall into this MLE trap again in the near future?

Thank you:)

Problem Link

There is a possible solution to this problem using the Burnside Lemma. I am just curious if there is any other way to solve this problem using basics of combinatorics.

Burnside Lemma/ Orbit COunting theorem

Thank you!