Count Ways To Build Good Strings - LeetCode 2466 - Python Solution

Solution Blog (sign into LeetCode to view): - https://leetcode.com/problems/count-ways-to-build-good-strings/solutions/3521503/intuitive-python-solution-solution-blog/ Base Case: - Stop considering different paths once you pass the "high" variable limit. - Return 0 because this won't be considered a "good string" Two Paths: 1. add "zero" many 0s 2. add "one" many 1s When to increment our number of "good strings"? - Whenever we see we're between "low" and "high" (inclusive) increment the count by 1! How to cache? - At every string length "n" we may reach this case and have to re-calculate all the same work. So at every step save the number of "good strings" you can build at this point & beyond! Complexity: - Time O(N) - Space O(N)