LintCode 496 · Toy Factory.py

LintCode 97 · Maximum Depth of Binary Tree.py

LintCode 1178 · Student Attendance Record I.py

LintCode 1 · A + B Problem.py

LintCode 39 · Recover Rotated Sorted Array.java

LintCode 423 · Valid Parentheses.java

LintCode 442 · Implement Trie (Prefix Tree).java

LintCode 1301 · Game of Life.java

LintCode 1704 · Range Sum of BST.java

LintCode 912 · Best Meeting Point.java

LintCode 1283 · Reverse String.java

LintCode 1794 · Count Duplicates.java

LintCode 38 · Search a 2D Matrix II.java

LintCode 683 · Word Break III.java

LintCode 927 · Reverse Words in a String II.java

LintCode 1186 · Encode and Decode TinyURL.java

LintCode 165 · Merge Two Sorted Lists.java

LintCode 167 · Add Two Numbers.java

LintCode 1046 · Prime Number of Set Bits in Binary Representation.java

Algoexpert Run-Length Encoding.java

Algoexpert Caesar Cipher Encryptor.java

Algoexpert Palindrome Check.java

LintCode 1449 · Loud and Rich.java

LintCode 1652 · Interval XOR II.java

LintCode 797 · Reach a Number.java

LintCode 242 · Convert Binary Tree to Linked Lists by Depth.java

LintCode 69 · Binary Tree Level Order Traversal.java

LintCode 1691 · Best Time to Buy and Sell Stock V.java

LintCode 363 · Trapping Rain Water.java

LintCode 1479 · Can Reach The Endpoint.java

LintCode 1678 · Train compartment problem.java

LintCode 1673 · Save Money.java

LintCode 1883 · Top K Frequently Mentioned Keywords.java

LintCode 40 · Implement Queue by Two Stacks.java

LintCode 229 · Stack Sorting.java

LintCode 608 · Two Sum II - Input array is sorted.java

LintCode 1676 · Skip Stones.java

LintCode 1671 · play game.java

LintCode 61 · Search for a Range.java

LintCode 62 · Search in Rotated Sorted Array.java

LintCode 461 · Kth Smallest Numbers in Unsorted Array.java

LintCode 5 · Kth Largest Element.java

LintCode 143 · Sort Colors II.java

LintCode 751 · John's business.java

LeetCode 760 · Binary Tree Right Side View.java

LintCode 1563 · Shortest path to the destination.java

LintCode 1360 · Symmetric Tree.java

Binary Search:
note that: "Check the left.left equal to the right.right."

LintCode 437 · Copy Books.java

Binary Search:
note that: "This one is tricky."

LintCode 127 · Topological Sorting.java

Topological Sorting:
note that: "BFS with indegree."

LintCode 801 · Backpack X.java

Backpack with Value array:
note that: "And the number of these merchandises can be considered as infinite."
function:
dp[i] |= dp[i - nums[j] * k]; (when you take that ith item)
or
dp[i] = false; (when you don't take that ith item)

LintCode 799 · Backpack VIII.java

Backpack with Value array:
note that: "Each item has different values and quantities."
function:
dp[i][j] |= dp[i - 1][j - A[i - 1] * k]; (when you take that ith item)
or
dp[i][j] = dp[i - 1][j]; (when you don't take that ith item)

LintCode 798 · Backpack VII.java

Backpack with Value array:
note that: "Given the weight, price and quantity constrains."
function:
dp[i][j] = Math.max(dp[i - 1][j - A[i - 1] * k] + V[i - 1] * k, dp[i][j]); (when you take that ith item)
or
dp[i][j] = dp[i - 1][j]; (when you don't take that ith item)

LintCode 564 · Combination Sum IV.java

Backpack with Value array:
note that: "A number in the array can be used multiple times in the combination."
function:
dp[i] += dp[i - nums[j - 1]]; (when you take that ith item)
or
dp[i] = 0; (when you don't take that ith item)

LintCode 563 · Backpack V.java

Backpack with Value array:
note that: "Each item may only be used once"
function:
dp[i][j] += dp[i - 1][j - nums[i - 1]]; (when you take that ith item)
or
dp[i][j] += dp[i - 1][j]; (when you don't take that ith item)

LintCode 562 · Backpack IV.java

Backpack with Value array:
note that: "Each item may be chosen unlimited number of times"
function:
dp[i][j] += dp[i - 1][j - A[i - 1] * k]; (when you take that ith item)
or
dp[i][j] += dp[i - 1][j]; (when you don't take that ith item)

LintCode 440 · Backpack III.java

Backpack with Value array:
note that now you can take k times, or "infinite times"
function:
dp[i][j] = Math.max(dp[i - 1][j - A[i - 1] * k] + V[i - 1] * k, dp[i][j]); (when you take that ith item)
or
dp[i][j] += dp[i - 1][j]; (when you don't take that ith item)

LintCode 125 · Backpack II.java

Backpack with Value array:
function:
dp[i][j] = Math.max(dp[i - 1][j - A[i - 1]] + V[i - 1], dp[i - 1][j]); (when you take that ith item)
or
dp[i][j] += dp[i - 1][j]; (when you don't take that ith item)

LintCode 92 · Backpack

Classic backpack:
function:
dp[i][j] = dp[i - 1][j];
dp[i][j] = dp[i - 1][j] || dp[i - 1][j - A[i-1]] (if it can fit that ith item, aka: j - A[i-1] >= 0)

LintCode 76 · Longest Increasing Subsequence

The dp: function is
dp[i] = Math.max(dp[i], dp[l] + 1);