Back to course home

0% completed

# Number factors

## Problem Statement

Given a number 'n', implement a method to count how many possible ways there are to express 'n' as the sum of 1, 3, or 4.

**Example 1:**

```
n : 4
Number of ways = 4
Explanation: Following are the four ways we can express 'n' : {1,1,1,1}, {1,3}, {3,1}, {4}
```

**Example 2:**

```
n : 5
Number of ways = 6
Explanation: Following are the six ways we can express 'n' : {1,1,1,1,1}, {1,1,3}, {1,3,1}, {3,1,1},
{1,4}, {4,1}
```

Let's first start with a recursive brute-force solution.

## Try it yourself

Try solving this question here:

.....

.....

.....

Like the course? Get enrolled and start learning!