Algorithm to Compute the Pascal Triangle’s values
The puzzle is to generate the first few numRows rows of Pascal’s Triangle. Do you need to keep each row in separate variables (row vector)? Apparently no. The trick …
Category: dynamic programming
C++ Coding Exercise – Triangle – Leetcode Online Judge – O(n) Dynamic Programming Optimisation
September 30, 2014
algorithms, c / c++, code, dynamic programming, implementation, leetcode online judge, programming languages, python
No Comments
This puzzle is from Leetcode Online Judge and this may appear quite often during interviews. This puzzle asks you to find the minimal sum for a number triangle. You …
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 – Unique Paths – LeetCode Online Judge – Dynamic Programming – Recursive Formula
March 17, 2014
algorithms, c / c++, code, code library, dynamic programming, leetcode online judge, math, optimization, programming languages
No Comments
Remember a couple days ago, I write a solution to this puzzle using Dynamic Programming (DP)? The DP solution helps to avoid duplicate computation in the sub-problems (smaller size). …
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 …