Increasing Paths, part 2

Problem Overview

• Count the total number of strictly increasing paths in the given structure.
• The output may reach 20,000,000,000 and will not fit in a 32-bit integer.
• Domain: path counting over ordered values, e.g., grids or graphs.
• A Hudson_river interviews coding interview problem and interview question.