My LeetCode Journey

Need to be able to handle integer overflow, there also situations where you add up smaller coins to a large amount than a larger coin. Dynamic Programming was used for the soltuion. https://leetcode.com/problems/coin-change/description/ A rather complete discussion is here: http://massivealgorithms.blogspot.ca/2015/12/leetcode-322-coin-change.html

Using Recursion https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/

https://leetcode.com/problems/string-to-integer-atoi/description/

The key trick lays where you restore the Minimum value after a Pop() operation. https://leetcode.com/problems/min-stack/description/

https://leetcode.com/problems/pascals-triangle-ii/description/ This one requires you to handle the integer overflow (at least for multiplication) issue.

https://leetcode.com/problems/pascals-triangle/description/

https://leetcode.com/problems/sudoku-solver/description/ Took a day to fix an bug but not too bad.