Break a Sentence into Words (Word Break Algorithms) – DFS, BFS and DP
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given …
Tag: dp
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 …
C/C++ Coding Exercise – Unique Paths II – Dynamic Programming with Obstacles – Leetcode Online Judge – DP with Constraints
March 23, 2014
algorithms, c / c++, code, dynamic programming, implementation, leetcode online judge, math, optimization, programming languages
No Comments
The Dynamic Programming DP is one of the most-used approach to solve problems that satisfy the overlapping sub-problems and the optimal substructures. The simplest example is to compute Fibonacci …
C/C++ Coding Exercise – Minimum Path Sum – Online Judge – Dynamic Programming – LeetCode
March 3, 2014
algorithms, beginner, c / c++, code, code library, dynamic programming, implementation, math, programming languages
No Comments
This is one of the classic DP (Dynamic Programming) exercises that you might be asked during your interview. To submit your solutions, you can visit LeetCode Online Judge. The …