title: Running time - Dynamic programming algorithm
body: <p>Any dynamic programming algorithm that solves N sub problems in the process of computing it's final answer must run in Ω(N) time.</p>
  
  <p>Is this statement true? I am thinking that it is indeed true as i need to compute every sub problem. Please let me know if i am wrong</p>