My 3rd Problem for HackerRank // Towers | Chase The Red

My 3rd Problem for HackerRank // Towers | Chase The Red

You're given infinitely many bricks of at most 15 different heights (other dimensions are not relevant here). You're also given a big integer $n$. The task is to count the time needed to build every possible tower of height N from the given bricks. Bricks are stacked vertically only and stand in an upright position. Two towers are different if their brick height sequences are different and building one tower takes exactly 2 time units regardless of its height.

Here is the full problem statement.

Solution

In the editorial I omit the fact that we have to count the time needed to build all towers - we will count here just the number of different towers and to get the result, you have to multiply this number by 2.

Read full article from My 3rd Problem for HackerRank // Towers | Chase The Red