DP-11 Counting Towers | Problem Solving | Competitive Programming | DSA | CSES

In this video we have discussed how to solve Counting Towers which is the 9th problem from the CSES problemset. This is a fairly complex problem and has an elegant solution. Problem Name: Counting Towers Problem Link: https://cses.fi/problemset/task/2413 Notes and Solution Codes from the video: https://github.com/Priyansh19077/Dyna... Try to code this problem with space optimization on your own. Practice Problems: Problem 1: https://leetcode.com/problems/number-... Problem 2: https://leetcode.com/problems/count-p... Connect with us: TLE Website: https://tle-eliminators.com/ TLE Community:   / discord   Instagram:   / tle_eliminators   Linkedin:   / tle-eliminators   Connect with Priyansh: Linkedin:   / priyansh-agarwal   Twitter:   / priyansh_31dec   Youtube:    / @priyanshagarwal   Other content worth checking out on this channel: 1. Post Contest Discussions of Codeforces contests:    • Codeforces Contest Solutions   2. Competitive Programming tricks:    • Competitive Programming Tricks   3. Our launch videos:    • New Launches   Timestamps: 0:00 Introduction 0:27 Understanding the problem 2:00 Understanding the constraints 3:33 Making observations 9:10 Type 1 cases 13:59 Type 2 cases 16:10 Summary 17:15 Constructing DP solution 24:58 Time and Space Complexity 27:11 Let's look at the code 29:51 Bonus for further optimizing 30:38 Thanks for Watching