LeetCode Spiral Matrix I and II is to test array index manipulation which can be done in both recursive and iterative manner to find the pattern of calculation

Read More
The key to solve this LeetCode Roman to Integer problem is to find or summarize the pattern about the conversion rules between roman number and integers.

Read More
LeetCode Minimum Path Sum: Dynamic Programming is used to define the minimum path sum recursive formula, with Memory Optimization, it would be done in O(n) space.

Read More
The key to solve this LeetCode Integer to Roman problem is to figure the corresponding mapping from the digits to Roman numbers.

Read More
LeetCode Decode Ways: Dynamic Programming is used to solve decode ways problem in iterative manner, this is a modified version of finding fibonacci numbers.

Read More