This repository will contain solutions for problems related to dynamic programming in the C programming language. ⚡
- Implement a recursive function to calculate the nth fibonacci sequence with
O(n)
time complexity - Implement an optimized one way grid-traveler program using recursion with
O(n*m)
time complexity. (n = rows, m = columns) - Implement an optmized, recursive can_sum program, that checks if it is possible to generate a target number by adding up numbers from a given array. The time complexity has to be
O(n*m)
. (n = target number, m = length of the array)