Day4

Question 1

Dyn programming:
can sum and has sumin the array,
very imp to review

Answer 1

1) make a tree, root is your target
2) recurssion with memorization for the remainder of the number from for loop of all items in the array.
3) before returning any result store it in memory.

# can sum to a number in an array, elements can be reused
# with brute force has o(n^m), m was target sum and n was array length
# with below method it comes down to O(m^2*n) and space O(m^2)
# return the array
# return the array with shortest number of integars

Question 2

2

Answer 2

2

Question 3

3

Answer 3

3

Question 4

4

Answer 4

4

Question 5

5

Answer 5

5