Tag: Memoziation

How to Maxmize Profits to Robbering in a Binary Tree using Dynamic Programming Algorithm?

March 16, 2016 algorithms, Binary Tree, c / c++, Depth First Search, DFS, Dynamic Programming, dynamic programming, Memoization, Recursion No Comments

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has …

[Continue Reading...]

Using the Dynamic Programming Algorithm, the Depth First Search or Breadth First Search to Solve House Robber Problem (Largest Sum of Non-Adjacent Numbers)

April 15, 2015 algorithms, BFS, Breadth First Search, c / c++, Depth First Search, DFS, Dynamic Programming, dynamic programming, Memoization, python, Recursion 3 Comments

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each …

[Continue Reading...]