Algorithm

Question 1

Dynamic Programming?

Answer 1

• The plain recursion algorithm has a runtime of O(2n) and a space complexity
  of O(n).
• The Memoization recursion algorithm has a runtime of O(n) and a space
  complexity of O(n).
• The Tabulation algorithm has a runtime of O(n) and a space complexity of O(1).

Question 1

Bit wise operation?

Question 2

Tree traverse?

Question 3

Graph traverse?

Question 4

What is dynamic progrmming?

Answer 4

Techniqe for computing recursive algorithm with highly overlapping subproblems by only solving each subproblems once.