algorithm Break a number in 3 parts (n/2, n/3, n/4) recursively to get maximum sum Given a number n, we can divide it in only three parts n/2, n/3 and n/4 recursively and find the maximum sum of the 3 parts. This can be solved in linear time using Dynamic Programming