##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Real algorithm problems)
Counting appears in substring problems (count valid substrings), tree problems (count paths), and combinatorics (count permutations).
Before solving a problem, ask: Can I count the possibilities? If the count is too large, you need a smarter approach (DP, greedy, etc.).
Counting helps you understand problem complexity. It's the first step in optimization.
